Uses of Package
fr.inria.opengve.bridge.interfaces

Packages that use fr.inria.opengve.bridge.interfaces

fr.inria.opengve.bridge.algorithms
fr.inria.opengve.bridge.algorithms.common	This package contains all algorithms common to directed and undirected graph.
fr.inria.opengve.bridge.algorithms.common.shortestPath
fr.inria.opengve.bridge.algorithms.directed	This package contains all algorithms specific to directed graph.
fr.inria.opengve.bridge.algorithms.undirected	This package contains all algorithms specific to undirected graph.
fr.inria.opengve.bridge.algorithms.undirected.minCut
fr.inria.opengve.bridge.interfaces	This package contains interfaces defining graph management.

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.algorithms

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

HierarchicalSet
This interface defines the functionalities of the sets returned by methods of the interface Graph.

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

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.algorithms.common

Cycle
Cycle is define as an undirected path in which : The first and the last vertex are identical An edge is only present one time

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

HierarchicalSet
This interface defines the functionalities of the sets returned by methods of the interface Graph.

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

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

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.algorithms.common.shortestPath

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

HierarchicalSet
This interface defines the functionalities of the sets returned by methods of the interface Graph.

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

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

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.algorithms.directed

Arc
As implied by its name, this interface models the mathematical arc abstraction, which can be viewed as a directed link.

Flow
This interface is used to manage flow.

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

HierarchicalSet
This interface defines the functionalities of the sets returned by methods of the interface Graph.

Map
The Map interface define a new data structure interface.

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

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.algorithms.undirected

Edge
/** As implied by its name, this interface models the mathematical edge abstraction, which can be viewed as an undirected link.

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

Map
The Map interface define a new data structure interface.

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.algorithms.undirected.minCut

Edge
/** As implied by its name, this interface models the mathematical edge abstraction, which can be viewed as an undirected link.

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

HierarchicalSet
This interface defines the functionalities of the sets returned by methods of the interface Graph.

Map
The Map interface define a new data structure interface.

Classes in fr.inria.opengve.bridge.interfaces used by fr.inria.opengve.bridge.interfaces

Arc
As implied by its name, this interface models the mathematical arc abstraction, which can be viewed as a directed link.

Flow
This interface is used to manage flow.

Graph
A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

HierarchicalSet
This interface defines the functionalities of the sets returned by methods of the interface Graph.

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

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