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

Packages that use Edge

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.visit	Visit algorithms implementation.

Uses of Edge in org.apache.commons.graph

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

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

Subinterfaces of Edge in org.apache.commons.graph

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	WeightedEdge<V extends Vertex> A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.

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

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

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.

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

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

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 Edge

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