Uses of Interface org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic (JGraphT : a free Java graph library)

Packages that use AStarAdmissibleHeuristic
Package Description

org.jgrapht.alg.shortestpath
Shortest-path related algorithms.

Uses of AStarAdmissibleHeuristic in org.jgrapht.alg.shortestpath

Classes in org.jgrapht.alg.shortestpath that implement AStarAdmissibleHeuristic
Modifier and Type	Class	Description
`class`	`ALTAdmissibleHeuristic<V,E>`	An admissible heuristic for the A* algorithm using a set of landmarks and the triangle inequality.

Fields in org.jgrapht.alg.shortestpath declared as AStarAdmissibleHeuristic
Modifier and Type	Field	Description
`protected AStarAdmissibleHeuristic<V>`	AStarShortestPath.`admissibleHeuristic`

Constructors in org.jgrapht.alg.shortestpath with parameters of type AStarAdmissibleHeuristic
Constructor	Description
`AStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic)`	Create a new instance of the A* shortest path algorithm.
`AStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic, Supplier<org.jheaps.AddressableHeap<Double,V>> heapSupplier)`	Create a new instance of the A* shortest path algorithm.
`BidirectionalAStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> heuristic)`	Constructs a new instance of the algorithm for a given graph and heuristic.
`BidirectionalAStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> heuristic, Supplier<org.jheaps.AddressableHeap<Double,V>> heapSupplier)`	Constructs a new instance of the algorithm for a given graph, heuristic and heap supplier.