Uses of Interface
net.datastructures.Vertex

Uses of Vertex in net.datastructures

Methods in net.datastructures that return Vertex

Vertex[]	Graph.endVertices(Edge<E> e) Returns the endvertices of a vertex as an array of length 2
Vertex<V>[]	AdjacencyListGraph.endVertices(Edge<E> e) Return the endvertices of a edge in an array of length 2
Vertex<V>	Graph.insertVertex(V o) Inserts and return a new vertex with a given element
Vertex<V>	AdjacencyListGraph.insertVertex(V o) Insert and return a new vertex with a given element
Vertex<V>	Graph.opposite(Vertex<V> v, Edge<E> e) Returns the other endvertex of an incident edge
Vertex<V>	AdjacencyListGraph.opposite(Vertex<V> v, Edge<E> e) Return the other endvertex of an incident edge

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

java.lang.Iterable<Vertex<V>>	Graph.vertices() Returns the vertices of the graph as an iterable collection
java.lang.Iterable<Vertex<V>>	AdjacencyListGraph.vertices() Return an iterator over the vertices of the graph

Methods in net.datastructures with parameters of type Vertex

boolean	Graph.areAdjacent(Vertex<V> u, Vertex<V> v) Tests whether two vertices are adjacent
boolean	Graph.areAdjacent(Vertex<V> u, Vertex<V> v) Tests whether two vertices are adjacent
boolean	AdjacencyListGraph.areAdjacent(Vertex<V> u, Vertex<V> v) Test whether two vertices are adjacent
boolean	AdjacencyListGraph.areAdjacent(Vertex<V> u, Vertex<V> v) Test whether two vertices are adjacent
int	AdjacencyListGraph.degree(Vertex<V> v) Return the degree of a given vertex
R	DFS.execute(Graph<V,E> g, Vertex<V> s, I in) Execute a depth first search traversal on graph g, starting from a start vertex s, passing in an information object (in)
void	Dijkstra.execute(Graph<V,E> g, Vertex<V> s, java.lang.Object w) Executes Dijkstra's algorithm.
int	Dijkstra.getDist(Vertex<V> u) Get the distance of a vertex from the source vertex.
java.lang.Iterable<Edge<E>>	Graph.incidentEdges(Vertex<V> v) Returns the edges incident on a vertex as an iterable collection
java.lang.Iterable<Edge<E>>	AdjacencyListGraph.incidentEdges(Vertex<V> v) Return an iterator over the edges incident on a vertex
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
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
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>	AdjacencyListGraph.insertEdge(Vertex<V> v, Vertex<V> w, E o) Insert and return a new edge with a given element between two vertices
Vertex<V>	Graph.opposite(Vertex<V> v, Edge<E> e) Returns the other endvertex of an incident edge
Vertex<V>	AdjacencyListGraph.opposite(Vertex<V> v, Edge<E> e) Return the other endvertex of an incident edge
V	Graph.removeVertex(Vertex<V> v) Removes a vertex and all its incident edges and returns the element stored at the removed vertex
V	AdjacencyListGraph.removeVertex(Vertex<V> v) Remove a vertex and all its incident edges and return the element stored at the removed vertex
V	Graph.replace(Vertex<V> p, V o) Replaces the element of a given vertex with a new element and returns the old element
V	AdjacencyListGraph.replace(Vertex<V> p, V o)