| Package | Description | 
|---|---|
| org.jgrapht | |
| org.jgrapht.alg | 
 Algorithms provided with JGraphT. 
 | 
| org.jgrapht.graph | 
 Implementations of various graphs. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
static <V,E> List<V> | 
Graphs.getPathVertexList(GraphPath<V,E> path)
Gets the list of vertices visited by a path. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
GraphPath<V,E> | 
DijkstraShortestPath.getPath()
Return the path found. 
 | 
GraphPath<V,E> | 
FloydWarshallShortestPaths.getShortestPath(V a,
               V b)
Get the shortest path between two vertices. 
 | 
GraphPath<V,E> | 
AStarShortestPath.getShortestPath(V sourceVertex,
               V targetVertex,
               AStarAdmissibleHeuristic<V> admissibleHeuristic)
Calculates (and returns) the shortest path from the sourceVertex to the
 targetVertex. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
List<GraphPath<V,E>> | 
AllDirectedPaths.getAllPaths(Set<V> sourceVertices,
           Set<V> targetVertices,
           boolean simplePathsOnly,
           Integer maxPathLength)
Calculate (and return) all paths from the source vertices to the target
 vertices. 
 | 
List<GraphPath<V,E>> | 
AllDirectedPaths.getAllPaths(V sourceVertex,
           V targetVertex,
           boolean simplePathsOnly,
           Integer maxPathLength)
Calculate (and return) all paths from the source vertex to the target
 vertex. 
 | 
List<GraphPath<V,E>> | 
KShortestPaths.getPaths(V endVertex)
Returns the k shortest simple paths in increasing order of weight. 
 | 
List<GraphPath<V,E>> | 
FloydWarshallShortestPaths.getShortestPaths()
Get all shortest paths in the graph. 
 | 
List<GraphPath<V,E>> | 
FloydWarshallShortestPaths.getShortestPaths(V v)
Get shortest paths from a vertex to all other vertices in the graph. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
GraphPathImpl<V,E>
GraphPathImpl is a default implementation of  
GraphPath. | 
class  | 
SimpleGraphPath<V,E>
A vertex-based representation of a simple path. 
 | 
Copyright © 2016. All rights reserved.