Modifier and Type | Field and Description |
---|---|
private java.util.List<Grafo.Edge<T>> |
Grafo.Dirigido.edges
Vector of edges in the graph
|
private java.util.List<Grafo.Edge<T>> |
Grafo.Vertex.incomingEdges |
private java.util.List<Grafo.Edge<T>> |
Grafo.Vertex.outgoingEdges |
Modifier and Type | Method and Description |
---|---|
Grafo.Edge<T>[] |
Grafo.Dirigido.findCycles()
Search the graph for cycles.
|
Grafo.Edge<T> |
Grafo.Vertex.findEdge(Grafo.Edge<T> e)
Search the outgoing edges for a match to e.
|
Grafo.Edge<T> |
Grafo.Vertex.findEdge(Grafo.Vertex<T> dest)
Search the outgoing edges looking for an edge whose's edge.to == dest.
|
Grafo.Edge<T> |
Grafo.Vertex.getIncomingEdge(int i)
Get the ith incoming edge
|
Grafo.Edge<T> |
Grafo.Vertex.getOutgoingEdge(int i)
Get the ith outgoing edge
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Grafo.Edge<T>> |
Grafo.Dirigido.getEdges()
Get the graph edges
|
Modifier and Type | Method and Description |
---|---|
boolean |
Grafo.Vertex.addEdge(Grafo.Edge<T> e)
Add an edge to the vertex.
|
Grafo.Edge<T> |
Grafo.Vertex.findEdge(Grafo.Edge<T> e)
Search the outgoing edges for a match to e.
|
boolean |
Grafo.Vertex.hasEdge(Grafo.Edge<T> e)
Check the vertex for either an incoming or outgoing edge mathcing e.
|
boolean |
Grafo.Vertex.remove(Grafo.Edge<T> e)
Remove an edge from this vertex
|
void |
Grafo.DFSVisitor.visit(Grafo.Dirigido<T> g,
Grafo.Vertex<T> v,
Grafo.Edge<T> e)
Used dfsSpanningTree to notify the visitor of each outgoing edge to an
unvisited vertex.
|
Modifier and Type | Method and Description |
---|---|
private void |
Grafo.Dirigido.visit(Grafo.Vertex<T> v,
java.util.ArrayList<Grafo.Edge<T>> cycleEdges) |