Uses of Package
org.apache.commons.graph

Packages that use org.apache.commons.graph

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.

Classes in org.apache.commons.graph used by org.apache.commons.graph

DirectedGraph
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.

Edge
An Edge is the link that connect a pair of Vertex.

Graph
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.

GraphException
GraphException This is the superclass of all exceptions that can be thrown.

Labeled
A Label is an identifier to be assigned to a Vertex or to an Edge.

Path
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.

Vertex
A Vertex or Node is the fundamental unit out of which graphs are formed.

WeightedEdge
A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.

Classes in org.apache.commons.graph used by org.apache.commons.graph.model

DirectedGraph
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.

Edge
An Edge is the link that connect a pair of Vertex.

Graph
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.

MutableGraph
The MutableGraph is a graph that supports the addition and removal of Vertex and Edges.

Path
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.

Vertex
A Vertex or Node is the fundamental unit out of which graphs are formed.

WeightedEdge
A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.

WeightedGraph
A graph is a WeightedGraph if a number (weight) is assigned to each edge.

WeightedPath
A Path where Edge are weighted.

Classes in org.apache.commons.graph used by org.apache.commons.graph.shortestpath

GraphException
GraphException This is the superclass of all exceptions that can be thrown.

Vertex
A Vertex or Node is the fundamental unit out of which graphs are formed.

WeightedEdge
A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.

WeightedGraph
A graph is a WeightedGraph if a number (weight) is assigned to each edge.

WeightedPath
A Path where Edge are weighted.

Classes in org.apache.commons.graph used by org.apache.commons.graph.spanning

Graph
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.

Vertex
A Vertex or Node is the fundamental unit out of which graphs are formed.

WeightedEdge
A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.

WeightedGraph
A graph is a WeightedGraph if a number (weight) is assigned to each edge.

Classes in org.apache.commons.graph used by org.apache.commons.graph.visit

Edge
An Edge is the link that connect a pair of Vertex.

Graph
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.

Vertex
A Vertex or Node is the fundamental unit out of which graphs are formed.