Plans regarding graphs and hypergraph constructions from clausesets.
More...
Go to the source code of this file.
Detailed Description
Plans regarding graphs and hypergraph constructions from clausesets.
 Todo:
 Organisation

Should we distinguish between Graphs.mac and Hypergraphs.mac?
 Todo:
 Lazy combinatorial matrices

For the different combinatorial matrices of clausesets, it seems best to provide all three different types of implementations (compare the discussion "Memoisation for general graphs and multigraphs" in ComputerAlgebra/Graphs/Lisp/plans/general.hpp).

The cm's which always (re)compute their values, as we have them now, provide the definitions.

Perhaps from them via some general framework we obtain the instantiated matrices (with values stored in arrays), and the hashed matrics.
 Todo:
 Implication graphs

DONE Given a (boolean) clauseset F, extract the clauses {a,b} of length 1 or 2, and create the directed graph with vertices the literals, and edges from a to b and from b to a.

Using graph_draw(dg2mdg(implication_dg_fcs(FF))):

The basic problem is that the vertex labels often cannot be seen properly.

If the graph is rather small,
draw_graph(G,show_label=true,head_length=0.05,label_alignment=center,vertex_size=5,head_length=0.1);
yields reasonable results.
Definition in file Hypergraphs.hpp.