Uses of Interface
fr.inria.opengve.bridge.interfaces.Graph

Packages that use Graph

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.

Uses of Graph in fr.inria.opengve.bridge.algorithms

Methods in fr.inria.opengve.bridge.algorithms with parameters of type Graph

static <V,L extends Link<V>> boolean	GraphUtility.checkProprieties(Graph<V,L> graph, GraphUtility.Propriety... propieties) Check if a graph have a given list of properties.
static <V,L extends Link<V>> void	GraphUtility.copyGraphInGraph(Graph<V,L> graph, Graph<V,L> emptyGraph) This method must return a subset-free copy of the graph.
static <V,L extends Link<V>> void	GraphUtility.copyGraphInGraph(Graph<V,L> graph, Graph<V,L> emptyGraph) This method must return a subset-free copy of the graph.
static <V,L extends Link<V>> boolean	GraphUtility.haveLoopLinks(Graph<V,L> graph) Test if a given graph contains a loop.
static <V,L extends Link<V>> boolean	GraphUtility.isConnectedGraph(Graph<V,L> graph, boolean stronglyConnectedRequired) Test the connectivity of a given graph.
static <V,L extends Link<V>> boolean	GraphUtility.isMultiGraph(Graph<V,L> graph) Test if a given graph is a multigraph.
protected void	StepAlgo.notifyGraphDisplayRequest(Graph<V,E> g) Send a graphic request.
protected void	StepAlgo.notifyGraphDisplayRequest(Graph<V,E> g, java.lang.String name) Send a graphic request.
protected void	StepAlgo.notifyLabelEdgesRequest(Graph<V,E> g, Map m, java.lang.Object context, java.lang.String label) Request a edges label display for a graph.
protected void	StepAlgo.notifyLabelVerticesRequest(Graph<V,E> g, Map m, java.lang.Object context, java.lang.String label) Request a vertices label display for a graph.
static <V,L extends Link<V>> HierarchicalSet<L>	GraphUtility.rechabilityLinks(V startingVertex, Graph<V,L> graph) Give the set of all reachable links from a given starting vertex.
static <V,L extends Link<V>> HierarchicalSet<V>	GraphUtility.rechabilityVertices(V startingVertex, Graph<V,L> graph, boolean includeStatingPoint) Give the set of vertices reachable from a given one.
protected abstract <V,L extends Link<V>> boolean	GraphUtility.Propriety.verify(Graph<V,L> graph) Verify that a given graph verify this property.

Uses of Graph in fr.inria.opengve.bridge.algorithms.common

Classes in fr.inria.opengve.bridge.algorithms.common with type parameters of type Graph

class	AugmentingPath<V,E extends Link<V>,G extends Graph<V,E>> This class construct augmenting path on a graph.
class	CopyGraph<V,E extends Link<V>,G extends Graph<V,E>> This class is the bridge abstract impelmentation of graph copy.
class	FindElementaryCycles<V,E extends Link<V>,G extends Graph<V,E>> This algorithms compute all the elementary cycles on a graph.
class	FindElementaryCyclesFrom<V,E extends Link<V>,G extends Graph<V,E>> This class compute all cycles of a graph containing a specific vertex.
class	RandomWalk<V,E extends Link<V>,G extends Graph<V,E>>

Uses of Graph in fr.inria.opengve.bridge.algorithms.common.shortestPath

Classes in fr.inria.opengve.bridge.algorithms.common.shortestPath with type parameters of type Graph

class	BellmanFord<V,E extends Link<V>,G extends Graph<V,E>> This class implement the Bellman-Ford algorithm.
class	Dijkstra<V,E extends Link<V>,G extends Graph<V,E>> Provides a simple algorithm to find distance from a vertex and the paths corresponding to this vertex.
class	DijkstraAdvanced<V,E extends Link<V>,G extends Graph<V,E>> Provides a advanced algorithm to find all shortest paths from a vertex.
class	FloydWarshall<V,E extends Link<V>,G extends Graph<V,E>> This class is the implementation of the Floyd-Warshall algorithms.
class	KShortestPaths<V,E extends Link<V>,G extends Graph<V,E>> This class solve the problem of k-shortest path (not disjoint).
class	ShortestPathWithSingleOrigin<V,E extends Link<V>,G extends Graph<V,E>> This class define common datas and methods between DijkstraAdvanced and BellmanFord.

Fields in fr.inria.opengve.bridge.algorithms.common.shortestPath declared as Graph

protected G

ShortestPathWithSingleOrigin.g_ The graph on which is the algorithms is applied.

Uses of Graph in fr.inria.opengve.bridge.algorithms.directed

Classes in fr.inria.opengve.bridge.algorithms.directed with type parameters of type Graph

class

EdmondsKarp<V,A extends Arc<V>,G extends Graph<V,A>> This algorithms is the implementation of the Edmonds-Karp version of the Ford-Fulkerson algorithms.

Methods in fr.inria.opengve.bridge.algorithms.directed with parameters of type Graph

protected abstract Flow<V,A>

ExtractFlow.createFlow(Graph<V,A> g) Create a new empty flow.

Constructors in fr.inria.opengve.bridge.algorithms.directed with parameters of type Graph

ExtractFlow(Graph<V,A> subGraph, V source, Flow<V,A> flow)
Constructor.

Uses of Graph in fr.inria.opengve.bridge.algorithms.undirected

Classes in fr.inria.opengve.bridge.algorithms.undirected with type parameters of type Graph

class

Kruskal<V,E extends Edge<V>,G extends Graph<V,E>> This class implement the Kruskal algorithms to compute minimum spanning tree, it work only on non directed graph.

Methods in fr.inria.opengve.bridge.algorithms.undirected that return Graph

protected abstract Graph<V,E>	PrimST.createGraph(Graph<V,E> g) Create a new empty graph sub graph of a given garph.
Graph<V,E>	PrimST.getMST() Return the computed minimum spanning tree.

Methods in fr.inria.opengve.bridge.algorithms.undirected with parameters of type Graph

protected abstract Graph<V,E>

PrimST.createGraph(Graph<V,E> g) Create a new empty graph sub graph of a given garph.

Constructors in fr.inria.opengve.bridge.algorithms.undirected with parameters of type Graph

PrimST(Graph<V,E> g, Map map)

PrimST(Graph<V,E> g, Map m, boolean demoMode)

Uses of Graph in fr.inria.opengve.bridge.algorithms.undirected.minCut

Classes in fr.inria.opengve.bridge.algorithms.undirected.minCut with type parameters of type Graph

class

NagamochiMinCut<V,E extends Edge<V>,G extends Graph<V,E>> Compute the minimum cut of a graph.

Methods in fr.inria.opengve.bridge.algorithms.undirected.minCut that return Graph

protected abstract Graph<V,E>

StoerWagnerMinCut.copyGraph(Graph<V,E> g) Get a copy of the given graph.

Methods in fr.inria.opengve.bridge.algorithms.undirected.minCut with parameters of type Graph

protected abstract Graph<V,E>	StoerWagnerMinCut.copyGraph(Graph<V,E> g) Get a copy of the given graph.
void	StoerWagnerMinCut.setGraph(Graph<V,E> graph) Set the graph on which is computed the minimal cut.

Uses of Graph in fr.inria.opengve.bridge.interfaces

Methods in fr.inria.opengve.bridge.interfaces that return Graph

Graph<V,E>	Graph.complement() Returns the complement of this graph.
Graph<V,A>	MultiFlow.getSupportingGraph() Give the supporting graph associated with this flow.
Graph<V,A>	Flow.getUnderlyingGraph() Give the underlying graph associated with this flow.
Graph<V,E>	Graph.inducedSubGraph(java.util.Set<V> subSet) Returns the subgraph induced by the specified subset of vertices.
Graph<V,E>	Graph.inverse() Returns the inverse of this graph.