Class SlowSparseNumberedLabeledGraph<T,U>
java.lang.Object
com.ibm.wala.util.graph.AbstractGraph<T>
com.ibm.wala.util.graph.AbstractNumberedGraph<T>
com.ibm.wala.util.graph.labeled.AbstractNumberedLabeledGraph<T,U>
com.ibm.wala.util.graph.labeled.SlowSparseNumberedLabeledGraph<T,U>
- All Implemented Interfaces:
EdgeManager<T>
,Graph<T>
,LabeledEdgeManager<T,
,U> LabeledGraph<T,
,U> NumberedLabeledEdgeManager<T,
,U> NumberedLabeledGraph<T,
,U> NodeManager<T>
,NumberedEdgeManager<T>
,NumberedGraph<T>
,NumberedNodeManager<T>
,Serializable
,Iterable<T>
- Direct Known Subclasses:
AbstractFlowGraph
public class SlowSparseNumberedLabeledGraph<T,U>
extends AbstractNumberedLabeledGraph<T,U>
implements Serializable
A labeled graph implementation suitable for sparse graphs.
- See Also:
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionstatic <T,
U> void copyInto
(LabeledGraph<T, U> g, LabeledGraph<T, U> into) static <T,
U> SlowSparseNumberedLabeledGraph <T, U> duplicate
(LabeledGraph<T, U> g) protected NumberedLabeledEdgeManager
<T, U> protected NumberedNodeManager
<T> Methods inherited from class com.ibm.wala.util.graph.labeled.AbstractNumberedLabeledGraph
addEdge, edgeString, getDefaultLabel, getEdgeLabels, getPredLabels, getPredNodeCount, getPredNodeNumbers, getPredNodes, getSuccLabels, getSuccNodeCount, getSuccNodeNumbers, getSuccNodes, hasEdge, removeEdge
Methods inherited from class com.ibm.wala.util.graph.AbstractNumberedGraph
getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes
Methods inherited from class com.ibm.wala.util.graph.AbstractGraph
addEdge, addNode, containsNode, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, nodeString, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream, toString
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface com.ibm.wala.util.graph.EdgeManager
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges
Methods inherited from interface com.ibm.wala.util.graph.Graph
removeNodeAndEdges
Methods inherited from interface java.lang.Iterable
forEach, spliterator
Methods inherited from interface com.ibm.wala.util.graph.labeled.LabeledEdgeManager
getPredNodes
Methods inherited from interface com.ibm.wala.util.graph.NodeManager
addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream
Methods inherited from interface com.ibm.wala.util.graph.NumberedEdgeManager
getPredNodeNumbers, getSuccNodeNumbers
Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager
getMaxNumber, getNode, getNumber, iterateNodes
-
Constructor Details
-
SlowSparseNumberedLabeledGraph
public SlowSparseNumberedLabeledGraph() -
SlowSparseNumberedLabeledGraph
-
-
Method Details
-
duplicate
- Returns:
- a graph with the same nodes and edges as g
-
copyInto
-
getEdgeManager
- Specified by:
getEdgeManager
in classAbstractNumberedLabeledGraph<T,
U> - Returns:
- the object which manages edges in the graph
-
getNodeManager
- Specified by:
getNodeManager
in classAbstractNumberedGraph<T>
- Returns:
- the object which manages nodes in the graph
-