OKlibrary  0.2.1.6
general.hpp File Reference

Plans for the general module on graph-components. More...

Go to the source code of this file.

Namespaces

namespace  OKlib::Combinatorics::Graphs
 

Supermodule for dedicated graph algorithms.


namespace  OKlib
 

All components of the OKlibrary.


namespace  OKlib::Combinatorics
 

The part of the OKlibrary for general combinatorics.



Detailed Description

Plans for the general module on graph-components.

Todo:
Update the namespaces : DONE
Todo:
All sub-modules have milestones.
Todo:
Clarify the relations
Todo:
Update namespace usage.
Todo:
Graph generators
  • Path and cycle graphs.
  • See for first attempts at complete and complete bipartite graphs in Combinatorics/Graphs/BoostSupport/Generators.hpp.
  • Also complete k-partite graphs.
  • Circulant graphs.
  • Kneser grapsh (see ComputerAlgebra/Graphs), generalised Kneser graphs, and Johnson graphs.
Todo:
Graph operations
  • Sum
  • Various products
  • Complement
Todo:
Organisation
  • New module "TravellingSalesman"; see "Travelling salesman problem" in Applications/CombinatorialOptimisation/plans/general.hpp.
    1. Does this really belong to supermodule "Graphs"? Wouldn't part "Optimisation" be better? But that part is only for "real optimisation" ?
    2. Translation of SAT problems (given in Dimacs-format) into the various forms of NP-complete TSP-problems (first in Maxima/Lisp).
    3. And translations between the various forms of TSP-problems.
  • New module "HamiltonianPaths"; see HamiltonianPaths/plans/general.hpp for SAT applications.
    1. Translation of SAT-problems (given in DIMACS-format) into Hamiltonian-path-problems (first in Maxima/Lisp).

Definition in file general.hpp.