public class DirectedGraph<V>
extends java.lang.Object
Modifier and Type | Class and Description |
---|---|
protected class |
DirectedGraph.DirectedEdgeContainer |
protected class |
DirectedGraph.DirectedGraphInternal |
class |
DirectedGraph.Edge |
Constructor and Description |
---|
DirectedGraph(boolean allowLoops,
boolean allowMultipleEdges) |
Modifier and Type | Method and Description |
---|---|
DirectedGraph.Edge |
addEdge(V srcVertex,
V trgtVertex) |
boolean |
addVertex(V vertex) |
protected boolean |
assertVertexExist(V vertex) |
void |
clear() |
boolean |
containsEdge(DirectedGraph.Edge edge) |
boolean |
containsEdge(V srcVertex,
V trgtVertex) |
boolean |
containsVertex(V vertex) |
DirectedGraph.Edge |
getEdge(V srcVertex,
V trgtVertex) |
java.util.Set<DirectedGraph.Edge> |
incomingEdgesOf(V vertex) |
int |
inDegreeOf(V vertex) |
int |
outDegreeOf(V vertex) |
java.util.Set<DirectedGraph.Edge> |
outgoingEdgesOf(V vertex) |
public DirectedGraph(boolean allowLoops, boolean allowMultipleEdges)
protected boolean assertVertexExist(V vertex)
public boolean addVertex(V vertex)
public boolean containsVertex(V vertex)
public java.util.Set<DirectedGraph.Edge> outgoingEdgesOf(V vertex)
public java.util.Set<DirectedGraph.Edge> incomingEdgesOf(V vertex)
public int inDegreeOf(V vertex)
public int outDegreeOf(V vertex)
public DirectedGraph.Edge addEdge(V srcVertex, V trgtVertex)
public boolean containsEdge(DirectedGraph.Edge edge)
public DirectedGraph.Edge getEdge(V srcVertex, V trgtVertex)
public void clear()