Plans for concepts for bipartite graphs.
More...

Go to the source code of this file.

## Detailed Description

Plans for concepts for bipartite graphs.

**Todo:**- Concepts for bipartite graphs (with two vertex types), transferring as much as possible the concepts from the boost graph library. Related matrices: "reduced adjacency matrices".

**Todo:**- Operations for changing bipartite graphs: Adding / deleting edges, and adding / deleting vertices (from both parts), and the corresponding undo-operations.

**Todo:**- Literal-clause graphs and vertex-hyperede graphs yield bipartite graphs; for the former we have special relations between the literals (via the underlying variable).

**Todo:**- It seems, that the concept of bipartite graphs is (yet) most important as concept ("notion"), while models are provided only via hypergraphs and clause-sets, where the bipartite graphs are directly "embedded" into the data structure.

**Todo:**- Clarify the relations to module Graphs (see Graphs/plans/Graphs.hpp).

**Todo:**- Clarify the relation to Hypergraphs-concepts (see Hypergraphs/concepts/plans/general.hpp).

Definition in file BipartiteGraphs.hpp.