The QuickGraph.Representations namespace contains implementations of the graph concepts (traversal concepts and modification concepts).
Classes
| Class | Description | |
|---|---|---|
| AdjacencyGraph |
A mutable incidence graph implemetation
| |
| BidirectionalAdaptorGraph |
Creates a bidirectional graph out of a
IVertexAndEdgeListGraph graph.
| |
| BidirectionalGraph |
A mutable bidirectional graph implemetation
| |
| ClusteredAdjacencyGraph |
A clustered adjacency graph
| |
| EdgeList |
An edge-list representation of a graph is simply a sequence of edges,
where each edge is represented as a pair of vertex ID's.
| |
| ImplicitGraph | ||
| MutableTreeAdapterGraph |
A mutable tree-like graph
| |
| Representation |
Summary description for Representation.
| |
| ReversedBidirectionalGraph |
Adaptor to flip in-edges and out-edges.
| |
| TransitionDelegateCollection | ||
| TreeAdaptorGraph |
A tree-like wrapper for bidirectional graph
|
Delegates
| Delegate | Description | |
|---|---|---|
| TransitionDelegate |
