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

Packages that use Map

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

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

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

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.

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

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

protected abstract FindElementaryCyclesFrom<V,E,G>	FindElementaryCycles.createFindElementaryCyclesFrom(G g, V root, Map edgeCost, AbstractScalar maxCost) Create a new object of type FindElementaryCyclesFrom.
void	AugmentingPath.setCapacityMap(Map capacityMap) Set the map used to load capacity.
void	AugmentingPath.setCostMap(Map costMap) Set the map used to load cost.

Constructors in fr.inria.opengve.bridge.algorithms.common with parameters of type Map

FindElementaryCycles(G g, Map edgeCost, AbstractScalar maxCost)
Constructor.

FindElementaryCyclesFrom(G g, V root, Map edgeCost, AbstractScalar maxCost)
Constructor.

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

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

protected Map

ShortestPathWithSingleOrigin.result The map where result are stored.

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

protected abstract Map	ShortestPathWithSingleOrigin.createMap() This method is used to create a new Map
protected Map	ShortestPathWithSingleOrigin.getDistanceMap() Return the map where distance are stored.

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

void	ShortestPathWithSingleOrigin.setDistanceMap(Map m) Set the map used to load distance of edges.
void	FloydWarshall.setDistanceMap(Map distance) Set the map used to load distance of edges.

Constructors in fr.inria.opengve.bridge.algorithms.common.shortestPath with parameters of type Map

Dijkstra(G g, Map result)
Default constructor.

Dijkstra(G g, Map result, boolean stepMode)
Default constructor.

KShortestPaths(G g, Map distance)
Constructor of KShortestPaths.

KShortestPaths(G g, Map distance, boolean stepMode)
This constructor permit to specify the stepMode of the algorithm.

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

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

EdmondsKarp(G g, Map map)
Constructor.

EdmondsKarp(G g, Map map, boolean stepMode)

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

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

Kruskal(G g, Map map)
Constructor.

Kruskal(G g, Map map, boolean demoMode)
Constructor.

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

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

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

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

void	StoerWagnerMinCut.setDistanceMap(Map map) Set the map used to read edge's distance.
void	NagamochiMinCut.setEdgesValueMap(Map m) Set the map used to load edges values.