Package | Description |
---|---|
org.jgrapht.alg.shortestpath |
Shortest-path related algorithms.
|
org.jgrapht.alg.util |
Utilities used by JGraphT algorithms.
|
org.jgrapht.graph.specifics |
Implementations of specifics for various graph types.
|
Modifier and Type | Field and Description |
---|---|
protected Map<V,Pair<Double,E>> |
TreeSingleSourcePathsImpl.map
A map which keeps for each target vertex the predecessor edge and the total length of the
shortest path.
|
Constructor and Description |
---|
TreeSingleSourcePathsImpl(Graph<V,E> g,
V source,
Map<V,Pair<Double,E>> distanceAndPredecessorMap)
Construct a new instance.
|
Modifier and Type | Class and Description |
---|---|
class |
UnorderedPair<A,B>
Generic unordered pair.
|
Modifier and Type | Method and Description |
---|---|
static <A,B> Pair<A,B> |
Pair.of(A a,
B b)
Creates new pair of elements pulling of the necessity to provide corresponding types of the
elements supplied.
|
Modifier and Type | Field and Description |
---|---|
protected Map<Pair<V,V>,ArrayUnenforcedSet<E>> |
FastLookupUndirectedSpecifics.touchingVerticesToEdgeMap |
protected Map<Pair<V,V>,ArrayUnenforcedSet<E>> |
FastLookupDirectedSpecifics.touchingVerticesToEdgeMap |
Copyright © 2017. All rights reserved.