| Home | Trees | Indices | Help |
|
|---|
|
|
Hypergraphs
|
|||
| HypergraphError | |||
| RedundancyError | |||
| GraphicalityError | |||
| DecomposabilityError | |||
|
Incidence Graphs and hypergraphs are implemented differently, so even though hypergraphs are a generalisation of graphs there is no direct inheritance relation defined for the relevant classes. |
|||
|
Hypergraph A hypergraph is a collection of hyperedges. |
|||
|
SimpleHypergraph A simple hypergraph has no repeated hyperedges and thus is a set of hyperedges. |
|||
|
ReducedHypergraph Hypergraphs without redundant hyperedges |
|||
|
GraphicalHypergraph For a hypergraph H to be graphical, the hyperedges of red(H) must be the cliques of an (undirected) graph. |
|||
|
ReducedGraphicalHypergraph For a hypergraph H to be graphical, the hyperedges of red(H) must be the cliques of an (undirected) graph. |
|||
|
DecomposableHypergraph For a graphical hypergraph to be decomposable, the hyperedges of red(H) must be the cliques of some (undirected) decomposable graph. |
|||
|
ReducedDecomposableHypergraph For a graphical hypergraph to be decomposable, and reduced the hyperedges of H must be the cliques of some (undirected) decomposable graph. |
|||
|
JoinForest A DecomposableHypergraph whose hyperedges are the vertices of a join forest |
|||
|
ReducedJoinForest A ReducedDecomposableHypergraph whose hyperedges are the vertices of a join forest |
|||
|
|||
| String |
_version = Version of this module |
||
Imports: Tkinter, member, emptyset, pretty_str_set, GraphCanvas
|
|||
_versionVersion of this module
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Thu Oct 15 15:34:02 2009 | http://epydoc.sourceforge.net |