## Uses of Class
cl.cromer.estructuras.Grafo.Edge

### Uses of Grafo.Edge in cl.cromer.estructuras

Fields in cl.cromer.estructuras with type parameters of type Grafo.Edge
`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`

Methods in cl.cromer.estructuras that return Grafo.Edge
`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

Methods in cl.cromer.estructuras that return types with arguments of type Grafo.Edge
`java.util.List<Grafo.Edge<T>>` Grafo.Dirigido.`getEdges()` Get the graph edges

Methods in cl.cromer.estructuras with parameters of type Grafo.Edge
`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.

Method parameters in cl.cromer.estructuras with type arguments of type Grafo.Edge
`private void` Grafo.Dirigido.`visit(Grafo.Vertex<T> v, java.util.ArrayList<Grafo.Edge<T>> cycleEdges)`