Package fr.inria.opengve.bridge.interfaces

This package contains interfaces defining graph management.

See:
Description

Interface Summary

Arc<E>	As implied by its name, this interface models the mathematical arc abstraction, which can be viewed as a directed link.
Cycle<V,E extends Link<V>>	Cycle is define as an undirected path in which : The first and the last vertex are identical An edge is only present one time
Edge<V>	/** As implied by its name, this interface models the mathematical edge abstraction, which can be viewed as an undirected link.
Flow<V,A extends Arc<V>>	This interface is used to manage flow.
Graph<V,E extends Link<V>>	A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.
HierarchicalSet<E>	This interface defines the functionalities of the sets returned by methods of the interface Graph.
Link<V>	The root interface in the hierarchy of interfaces implemented by elements of the set returned by the linkSet method of some graph (more precisely, of an implementation of the Graph interface).
Map	The Map interface define a new data structure interface.
MultiFlow<V,A extends Arc<V>>	This interface is used to manage multi-flow.
Path<V,E extends Link<V>>	A path in a Graph is a sequence of vertices such that from each of its vertices there is an Link to the successor vertex.

Package fr.inria.opengve.bridge.interfaces Description

This package contains interfaces defining graph management.