Package | Description |
---|---|
org.jboss.util.graph |
Modifier and Type | Method and Description |
---|---|
Edge<T>[] |
Graph.findCycles()
Search the graph for cycles.
|
Edge<T> |
Vertex.findEdge(Edge<T> e)
Search the outgoing edges for a match to e.
|
Edge<T> |
Vertex.findEdge(Vertex<T> dest)
Search the outgoing edges looking for an edge whose's
edge.to == dest.
|
Edge<T> |
Vertex.getIncomingEdge(int i)
Get the ith incoming edge
|
Edge<T> |
Vertex.getOutgoingEdge(int i)
Get the ith outgoing edge
|
Modifier and Type | Method and Description |
---|---|
List<Edge<T>> |
Graph.getEdges()
Get the graph edges
|
Modifier and Type | Method and Description |
---|---|
boolean |
Vertex.addEdge(Edge<T> e)
Add an edge to the vertex.
|
Edge<T> |
Vertex.findEdge(Edge<T> e)
Search the outgoing edges for a match to e.
|
boolean |
Vertex.hasEdge(Edge<T> e)
Check the vertex for either an incoming or outgoing edge
mathcing e.
|
boolean |
Vertex.remove(Edge<T> e)
Remove an edge from this vertex
|
void |
DFSVisitor.visit(Graph<T> g,
Vertex<T> v,
Edge<T> e)
Used dfsSpanningTree to notify the visitor of each outgoing edge to
an unvisited vertex.
|
Copyright © 2018 JBoss by Red Hat. All rights reserved.