public class SparseNumberedGraph<T extends INodeWithNumber> extends AbstractNumberedGraph<T>
Constructor and Description |
---|
SparseNumberedGraph() |
SparseNumberedGraph(DelegatingNumberedNodeManager<T> nodeManager,
SparseNumberedEdgeManager<T> edgeManager) |
SparseNumberedGraph(int normalCase)
If normalCase == n, the s edge manager will eagerly allocated n words to hold out edges for each node.
|
Modifier and Type | Method and Description |
---|---|
protected NumberedEdgeManager<T> |
getEdgeManager() |
protected NumberedNodeManager<T> |
getNodeManager() |
getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes
addEdge, addNode, containsNode, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
removeNodeAndEdges
addNode, containsNode, getNumberOfNodes, iterator, removeNode
forEach, spliterator
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges
public SparseNumberedGraph()
public SparseNumberedGraph(int normalCase)
normalCase
- what is the "normal" number of out edges for a node?public SparseNumberedGraph(DelegatingNumberedNodeManager<T> nodeManager, SparseNumberedEdgeManager<T> edgeManager)
protected NumberedNodeManager<T> getNodeManager()
getNodeManager
in class AbstractNumberedGraph<T extends INodeWithNumber>
protected NumberedEdgeManager<T> getEdgeManager()
getEdgeManager
in class AbstractNumberedGraph<T extends INodeWithNumber>