public class CompleteGraph extends AbstractIntegerNodeGraph
Graph
containing a set of Integer
nodes where there is an edge between every pair of nodes.AbstractIntegerNodeGraph.AbstractIntegerEdgeCollection, AbstractIntegerNodeGraph.EdgeImpl
Graph.Edge
Constructor and Description |
---|
CompleteGraph(int n)
Creates a new
CompleteGraph . |
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, traverser
addEdge, addNode, adjacentNodes, degree, edges, getAdjacentNode, getEdge, getIncidentEdge, getNode, incidentEdges, nodes, traverser
public int degree(Object node)
node
, defined as the number
of edges incident on node
.degree
in interface Graph
degree
in class AbstractGraph
node
- return the degree of this node.node
.protected Graph.Edge createEdge(int tailIndex, int headIndex)
AbstractIntegerNodeGraph
null
. The indices are
assumed to represent valid nodes for this Graph
.createEdge
in class AbstractIntegerNodeGraph
protected Collection createEdgeCollection()
AbstractIntegerNodeGraph
createEdgeCollection
in class AbstractIntegerNodeGraph
protected Traverser createTraverser(int nodeIndex)
AbstractIntegerNodeGraph
createTraverser
in class AbstractIntegerNodeGraph
See 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.