Uses of Interface
org.apache.commons.graph.Vertex

Packages that use Vertex

org.apache.commons.graph	Main APIs that describe Graph data structure.
org.apache.commons.graph.model	In-memory based data-structures implementations.
org.apache.commons.graph.shortestpath	Shortest Path algorithms implementations.
org.apache.commons.graph.spanning	Minimum spanning tree (forest) algorithms implementation.
org.apache.commons.graph.visit	Visit algorithms implementation.

Uses of Vertex in org.apache.commons.graph

Classes in org.apache.commons.graph with type parameters of type Vertex

interface	DirectedGraph<V extends Vertex,E extends Edge<V>> A DirectedGraph or digraph is an ordered pair D = ( V, E ) with V a set whose elements are called vertices or nodes, and E a set of ordered pairs of vertices, called arcs, directed edges, or arrows.
interface	Edge<V extends Vertex> An Edge is the link that connect a pair of Vertex.
interface	Graph<V extends Vertex,E extends Edge<V>> A Graph data structure consists of a finite (and possibly mutable) set of ordered pairs, called Edges or arcs, of certain entities called Vertex or node.
interface	LabeledEdge<V extends Vertex> An edge labeling is a function mapping Edges of a Graph to a set of labels.
interface	LabeledWeightedEdge<V extends Vertex> A LabeledEdge with weight.
interface	MutableDirectedGraph<V extends Vertex,E extends Edge<V>> The MutableDirectedGraph is a directed graph that supports the addition and removal of Vertex and Edges.
interface	MutableGraph<V extends Vertex,E extends Edge<V>> The MutableGraph is a graph that supports the addition and removal of Vertex and Edges.
interface	Path<V extends Vertex,E extends Edge<V>> A Path in a Graph is a sequence of Vertex such that from each of its vertices there is an Edge to the next Vertex in the sequence.
interface	UndirectedGraph<V extends Vertex,E extends Edge<V>> An UndirectedGraph is a graph in which edges have no orientation, i.e., they are not ordered pairs, but sets {u, v} (or 2-multisets) of vertices.
interface	WeightedEdge<V extends Vertex> A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.
interface	WeightedGraph<V extends Vertex,WE extends WeightedEdge<V>> A graph is a WeightedGraph if a number (weight) is assigned to each edge.
interface	WeightedPath<V extends Vertex,WE extends WeightedEdge<V>> A Path where Edge are weighted.

Subinterfaces of Vertex in org.apache.commons.graph

interface

LabeledVertex A vertex labeling is a function mapping a set of Vertex of a Graph to a set of labels.

Uses of Vertex in org.apache.commons.graph.model

Classes in org.apache.commons.graph.model with type parameters of type Vertex

class	BaseGraph<V extends Vertex,E extends Edge<V>> Basic abstract in-memory based of a simple read-only Graph implementation.
class	BaseMutableGraph<V extends Vertex,E extends Edge<V>> Basic abstract in-memory based of a simple mutable Graph implementation.
class	DirectedMutableGraph<V extends Vertex,E extends Edge<V>> A memory-based implementation of a mutable directed Graph.
class	DirectedMutableWeightedGraph<V extends Vertex,WE extends WeightedEdge<V>> A memory-based implementation of a mutable, directed weighted Graph.
class	InMemoryPath<V extends Vertex,WE extends WeightedEdge<V>> Support WeightedPath implementation, optimized for algorithms (such Dijkstra's) that need to rebuild the path traversing the predecessor list bottom-up.

Uses of Vertex in org.apache.commons.graph.shortestpath

Methods in org.apache.commons.graph.shortestpath with type parameters of type Vertex

static <V extends Vertex,WE extends WeightedEdge<V>> WeightedPath<V,WE>

Dijkstra.findShortestPath(WeightedGraph<V,WE> graph, V source, V target) Applies the classical Dijkstra algorithm to find the shortest path from the source to the target, if exists.

Uses of Vertex in org.apache.commons.graph.spanning

Methods in org.apache.commons.graph.spanning with type parameters of type Vertex

static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>	Prim.minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.
static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>	Kruskal.minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.
static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>	Boruvka.minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.

Uses of Vertex in org.apache.commons.graph.visit

Classes in org.apache.commons.graph.visit with type parameters of type Vertex

class	BaseGraphVisitHandler<V extends Vertex,E extends Edge<V>> Base NOOP GraphVisitHandler implementation.
interface	GraphVisitHandler<V extends Vertex,E extends Edge<V>> Description of the Interface

Methods in org.apache.commons.graph.visit with type parameters of type Vertex

<V extends Vertex,E extends Edge<V>> void	Visit.breadthFirstSearch(Graph<V,E> graph, V source) Breadth-first search algorithm implementation.
<V extends Vertex,E extends Edge<V>> void	Visit.breadthFirstSearch(Graph<V,E> graph, V source, GraphVisitHandler<V,E> handler) Breadth-first search algorithm implementation.
<V extends Vertex,E extends Edge<V>> void	Visit.depthFirstSearch(Graph<V,E> graph, V source) Depth-first search algorithm implementation.
<V extends Vertex,E extends Edge<V>> void	Visit.depthFirstSearch(Graph<V,E> graph, V source, GraphVisitHandler<V,E> handler) Depth-first search algorithm implementation.