public class LoopGraph extends AbstractIntegerNodeGraph
Graph.AbstractIntegerNodeGraph.AbstractIntegerEdgeCollection, AbstractIntegerNodeGraph.EdgeImplGraph.Edge| Constructor and Description |
|---|
LoopGraph(int n,
int offset)
Creates a new
LoopGraph. |
| Modifier and Type | Method and Description |
|---|---|
protected Graph.Edge |
createEdge(int tailIndex,
int headIndex)
If an edge exists between the specified indices, create and
return it.
|
protected Collection |
createEdgeCollection()
Creates the (single) collection of edges for this instance.
|
protected Traverser |
createTraverser(int nodeIndex)
Creates a traverser with no filtering; assumes that the node
index is valid.
|
int |
degree(Object node)
Returns the degree of
node, defined as the number
of edges incident on node. |
String |
toString() |
checkNode, containsEdge, containsNode, edges, getNodeIndex, getNodeSize, nodes, removeEdge, removeNode, traverseraddEdge, addNode, adjacentNodes, degree, edges, getAdjacentNode, getEdge, getIncidentEdge, getNode, incidentEdges, nodes, traverserpublic int degree(Object node)
node, defined as the number
of edges incident on node.degree in interface Graphdegree in class AbstractGraphnode - return the degree of this node.node.protected Graph.Edge createEdge(int tailIndex, int headIndex)
AbstractIntegerNodeGraphnull. The indices are
assumed to represent valid nodes for this Graph.createEdge in class AbstractIntegerNodeGraphprotected Collection createEdgeCollection()
AbstractIntegerNodeGraphcreateEdgeCollection in class AbstractIntegerNodeGraphprotected Traverser createTraverser(int nodeIndex)
AbstractIntegerNodeGraphcreateTraverser in class AbstractIntegerNodeGraphSee the Plexus project home, hosted by SourceForge.
Copyright ? 1994-2006, by Phoenix Software Technologists, Inc. and others. All Rights Reserved. Use is subject to license terms.