public class SlowSparseNumberedGraph<T> extends AbstractNumberedGraph<T> implements Serializable
Modifier | Constructor and Description |
---|---|
protected |
SlowSparseNumberedGraph() |
|
SlowSparseNumberedGraph(int normalOutCount)
If normalOutCount == n, this edge manager will eagerly allocated n words to hold out edges for each node.
|
Modifier and Type | Method and Description |
---|---|
static <T> void |
copyInto(Graph<T> g,
Graph<T> into) |
static <T> SlowSparseNumberedGraph<T> |
duplicate(Graph<T> g) |
NumberedEdgeManager<T> |
getEdgeManager() |
NumberedNodeManager<T> |
getNodeManager() |
static <T> SlowSparseNumberedGraph<T> |
make() |
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
protected SlowSparseNumberedGraph()
public SlowSparseNumberedGraph(int normalOutCount)
normalOutCount
- what is the "normal" number of out edges for a node?public NumberedNodeManager<T> getNodeManager()
getNodeManager
in class AbstractNumberedGraph<T>
public NumberedEdgeManager<T> getEdgeManager()
getEdgeManager
in class AbstractNumberedGraph<T>
public static <T> SlowSparseNumberedGraph<T> duplicate(Graph<T> g)
public static <T> SlowSparseNumberedGraph<T> make()