Class Summary |
BitMatrixGraph |
This class implements a graph which uses a bitmatrix as inner representation
of edges. |
ConstUndirGraph |
This class is an adaptor making any Graph an undirected graph
by making its edges bidirectional. |
FastUndirGraph |
Speeds up ConstUndirGraph.isEdge(int, int) by storing the links in an
adjacency matrix (in fact in a triangle). |
GraphAlgorithms |
Implements graph algorithms. |
GraphFactory |
Contains static methods for wiring certain kinds of graphs. |
GraphIO |
Implements static methods to load and write graphs. |
NeighbourListGraph |
Implements a graph which uses the neighbour list representation. |
PrefixSubGraph |
This class is an adaptor for representing special subgraphs of any graph. |
SubGraphEdges |
This class is an adaptor for representing subgraphs of any graph. |
UndirectedGraph |
This class is an adaptor making any Graph an undirected graph
by making its edges bidirectional. |