Package org.jgrapht.alg.interfaces

Interface ManyToManyShortestPathsAlgorithm<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Superinterfaces:

ShortestPathAlgorithm<V,E>

All Known Implementing Classes:

CHManyToManyShortestPaths, DefaultManyToManyShortestPaths, DijkstraManyToManyShortestPaths

public interface ManyToManyShortestPathsAlgorithm<V,E>
extends ShortestPathAlgorithm<V,E>

An algorithm which computes shortest paths from all sources to all targets.

Author:

Semen Chudakov

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static class	ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl<V,E>	Base class for many-to-many shortest paths implementations.
static interface	ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	A set of paths from all sources vertices to all target vertices.

Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm

ShortestPathAlgorithm.SingleSourcePaths<V,E>

Method Summary

Modifier and Type	Method	Description
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	getManyToManyPaths(java.util.Set<V> sources, java.util.Set<V> targets)	Computes shortest paths from all vertices in sources to all vertices in targets.

Methods inherited from interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm

getPath, getPaths, getPathWeight

Method Detail

getManyToManyPaths

ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> getManyToManyPaths(java.util.Set<V> sources,
                                                                                       java.util.Set<V> targets)

Computes shortest paths from all vertices in sources to all vertices in targets.

Parameters:

sources - list of sources vertices

targets - list of target vertices

Returns:

computed shortest paths