Class | Description |
---|---|
HyperConnection |
The
HyperConnection class represents a edge-weighted
hypergraph composed of vertices named 0 through V - where each
directed hypereedge is of type HyperEdge and is composed of a set of
inner-edges. |
HyperEdge |
An (directed) Hyperedge correspond to a set of inneredges
All theses ineredges have the same source
|
ShortestHyperPath |
The ShortestHyperPath class permits to compute theShortest hyperpath
in a hypergraph.
|