com.phoenixst.plexus.examples
public class CirculantGraph extends AbstractIntegerNodeGraph
Graph. If the nodes are arranged in a
circle, then each node is adjacent to a fixed number of nodes in
either direction.
Since: 1.0
Version: $Revision: 1.13 $
| Constructor Summary | |
|---|---|
| CirculantGraph(int n, int d)
Creates a new CirculantGraph.
| |
| Method Summary | |
|---|---|
| protected Graph.Edge | createEdge(int tailIndex, int headIndex) |
| protected Collection | createEdgeCollection() |
| protected Traverser | createTraverser(int nodeIndex) |
| int | degree(Object node)
Returns the degree of node, defined as the number
of edges incident on node. |
| String | toString() |
CirculantGraph.
Parameters: n the number of nodes in the new
CirculantGraph.
d each node is adjacent to this many of the nearest
nodes in either direction.
node, defined as the number
of edges incident on node.