|
Class Summary |
| ALGraph |
An Adjacency list implementation of the Graph interface. |
| AMGraph |
An Adjacency matrix implementation of the Graph interface
Not fully implemented. |
| BAGraph |
Generetes a power-law out-degree graph using Barabasi-Albert model. |
| CompleteGraph |
Generates a complete graph with the specified number of
nodes. |
| Edge |
Implements an Edge data structure for graphs. |
| Graph |
An abstract base class for graph implementations. |
| NAryTree |
Generates an N-ary tree with a given N and a given depth. |
| NDimensionalGrid |
Generates a graph on an n-dimensional grid, i.e. |
| NDimensionalWrappedGrid |
Generates a graph on an n-dimensional grid that wraps
around at the edges, i.e. |
| PLODGraph |
Generetes a power-law out-degree graph using PLOD algorithm by
Palmer and Steffan (Generating Network Topologies That Obey Power Laws). |
| RandomGraph |
Generates a random graph with the specified number of
nodes and edges. |
| RingGraph |
Generates a ring structured graph with the specified number
of nodes. |
| RoadGraph |
Generates a road graph with the specified number
of nodes. |
| SmallWorldGraph |
Generates a random graph using the Watts-Strogatz model
Nature 1998. |
| StarGraph |
Generates a star graph with n nodes total. |