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

Packages that use Path

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.interfaces	This package contains interfaces defining graph management.

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

Methods in fr.inria.opengve.bridge.algorithms.common that return Path

Path<V,E>	CopyPath.copyPath(Path<V,E> p) Copy the path p.
protected abstract Path<V,E>	AugmentingPath.createPath() Create a new empty path of the same type that graph g.
abstract Path<V,E>	CopyPath.createPath() Create an empty path.
abstract Path<V,E>	RandomWalk.createPath() Create a new empty path.
protected abstract Path<V,E>	FindElementaryCyclesFrom.createPath() Create a new Path.
Path<V,E>	AugmentingPath.getBestPath(V source, V destination) Return the shortest path (in term of cost) with the maximum quantity of flow.
Path<V,E>	RandomWalk.getNextPath(V source, V destination) Give the next random walk.

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

Path<V,E>	CopyPath.copyPath(Path<V,E> p) Copy the path p.
protected abstract Cycle<V,E>	FindElementaryCyclesFrom.createCycle(Path<V,E> p, E e) Create a new cycle from a path and the edge closing this path.

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

Methods in fr.inria.opengve.bridge.algorithms.common.shortestPath that return Path

protected abstract Path<V,E>	ShortestPathWithSingleOrigin.createPath() This method is used to create Path
protected abstract Path<V,E>	Dijkstra.createPath() Method to create Path.
protected abstract Path<V,E>	KShortestPaths.createPath() Create a new path.
protected abstract Path<V,E>	FloydWarshall.createPath() Create a new empty path of the same type(directed or undirected) than the graph on which is applied this algorithms.
Path<V,E>	KShortestPaths.getShortestPath(int k) Return the k-th path computed.
Path<V,E>	FloydWarshall.getShortestPath(V source, V destination) Give a shortest path between two vertices.
Path<V,E>	ShortestPathWithSingleOrigin.getShortestPathTo(V v) Returns a shortest path form source to vertex v.
Path<V,E>	Dijkstra.getShortestPathTo(V v) Returns the path from source to vertex v.

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

Methods in fr.inria.opengve.bridge.algorithms.directed that return Path

protected abstract Path<V,A>

ExtractFlow.createDirectedPath() Give a new empty directed path.

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

Methods in fr.inria.opengve.bridge.interfaces with parameters of type Path

void	Path.concat(Path<V,E> p) Concat the path p to this path.