Package org.jgrapht.alg.interfaces
Interface MultiObjectiveShortestPathAlgorithm<V,E>
-
- Type Parameters:
V
- the graph vertex typeE
- the graph edge type
- All Known Implementing Classes:
MartinShortestPath
public interface MultiObjectiveShortestPathAlgorithm<V,E>
An algorithm which computes multi-objective shortest paths between vertices.- Author:
- Dimitrios Michail
-
-
Nested Class Summary
Nested Classes Modifier and Type Interface Description static interface
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>
A set of paths starting from a single source vertex.
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>
getPaths(V source)
Compute all shortest paths starting from a single source vertex.java.util.List<GraphPath<V,E>>
getPaths(V source, V sink)
Get a shortest path from a source vertex to a sink vertex.
-
-
-
Method Detail
-
getPaths
java.util.List<GraphPath<V,E>> getPaths(V source, V sink)
Get a shortest path from a source vertex to a sink vertex.- Parameters:
source
- the source vertexsink
- the target vertex- Returns:
- a shortest path or null if no path exists
-
getPaths
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E> getPaths(V source)
Compute all shortest paths starting from a single source vertex.- Parameters:
source
- the source vertex- Returns:
- the shortest paths
-
-