N - public class ExtendedHashMutableDirectedGraph<N> extends HashMutableDirectedGraph<N>
heads, nodeToPreds, nodeToSuccs, tails| Constructor and Description |
|---|
ExtendedHashMutableDirectedGraph() |
| Modifier and Type | Method and Description |
|---|---|
void |
addEdge(N from,
N to)
If nodes are not in the graph, add them into graph first.
|
void |
addMutualEdge(N from,
N to)
Add mutual edge to the graph.
|
<T extends N> |
mergeWith(ExtendedHashMutableDirectedGraph<T> other) |
void |
skipNode(N node)
Bypass the in edge to out edge.
|
String |
toString() |
addNode, clearAll, clone, containsEdge, containsNode, getHeads, getNodes, getPredsOf, getPredsOfAsSet, getSuccsOf, getSuccsOfAsSet, getTails, iterator, printGraph, removeEdge, removeNode, sizeequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitforEach, spliteratorpublic void addEdge(N from, N to)
addEdge in interface MutableDirectedGraph<N>addEdge in class HashMutableDirectedGraph<N>from - out node for the edge.to - in node for the edge.public void addMutualEdge(N from, N to)
public void skipNode(N node)
public <T extends N> void mergeWith(ExtendedHashMutableDirectedGraph<T> other)
Copyright © 2024 Soot OSS. All rights reserved.