Uses of Interface
net.datastructures.Edge

Packages that use Edge

Package	Description
net.datastructures

Uses of Edge in net.datastructures

Methods in net.datastructures that return Edge

Modifier and Type	Method and Description
Edge<E>	AdjacencyListGraph.insertEdge(Vertex<V> v, Vertex<V> w, E o) Insert and return a new edge with a given element between two vertices
Edge<E>	Graph.insertEdge(Vertex<V> u, Vertex<V> v, E o) Inserts and return a new edge with a given element between two vertices

Methods in net.datastructures that return types with arguments of type Edge

Modifier and Type	Method and Description
java.lang.Iterable<Edge<E>>	AdjacencyListGraph.edges() Return an iterator over the edges of the graph
java.lang.Iterable<Edge<E>>	Graph.edges() Returns the edges of the graph as an iterable collection
java.lang.Iterable<Edge<E>>	AdjacencyListGraph.incidentEdges(Vertex<V> v) Return an iterator over the edges incident on a vertex
java.lang.Iterable<Edge<E>>	Graph.incidentEdges(Vertex<V> v) Returns the edges incident on a vertex as an iterable collection

Methods in net.datastructures with parameters of type Edge

Modifier and Type	Method and Description
Vertex<V>[]	AdjacencyListGraph.endVertices(Edge<E> e) Return the endvertices of a edge in an array of length 2
Vertex[]	Graph.endVertices(Edge<E> e) Returns the endvertices of a vertex as an array of length 2
Vertex<V>	AdjacencyListGraph.opposite(Vertex<V> v, Edge<E> e) Return the other endvertex of an incident edge
Vertex<V>	Graph.opposite(Vertex<V> v, Edge<E> e) Returns the other endvertex of an incident edge
E	AdjacencyListGraph.removeEdge(Edge<E> e) Remove an edge and return its element
E	Graph.removeEdge(Edge<E> e) Removes an edge and return its element
E	AdjacencyListGraph.replace(Edge<E> p, E o)
E	Graph.replace(Edge<E> p, E o) Replaces the element of a given edge with a new element and returns the old element