Module org.jgrapht.core

Package org.jgrapht.alg.shortestpath

Class BidirectionalAStarShortestPath.AStarSearchFrontier

java.lang.Object

org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>

org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier

Enclosing class:

BidirectionalAStarShortestPath<V,E>

class BidirectionalAStarShortestPath.AStarSearchFrontier
extends BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>

Maintains search frontier during shortest path computation.

Field Summary

Fields

Modifier and Type	Field	Description
(package private) final Map<V,E>	cameFrom	Predecessor map.
(package private) final Set<V>	closedList	Closed nodes of the frontier.
(package private) final V	endVertex	End vertex of the frontier.
(package private) final Map<V,Double>	gScoreMap	Tentative distance to the vertices in tha graph computed so far.
(package private) final AStarAdmissibleHeuristic<V>	heuristic	Heuristic used in this frontier.
(package private) final org.jheaps.AddressableHeap<Double,V>	openList	Open nodes of the frontier.
(package private) final Map<V,org.jheaps.AddressableHeap.Handle<Double,V>>	vertexToHeapNodeMap

Fields inherited from class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier

graph

Constructor Summary

Constructors

Constructor	Description
AStarSearchFrontier(Graph<V,E> graph, V endVertex, AStarAdmissibleHeuristic<V> heuristic)

Method Summary

Modifier and Type	Method	Description
(package private) double	getDistance(V v)	Returns distance to vertex v computed so far.
(package private) E	getTreeEdge(V v)	Returns edge which connects v to its predecessor in the shortest paths tree of this frontier.
(package private) void	updateDistance(V v, E e, double tentativeGScore, double fScore)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

endVertex

final V endVertex

End vertex of the frontier.

heuristic

final AStarAdmissibleHeuristic<V> heuristic

Heuristic used in this frontier.

openList

final org.jheaps.AddressableHeap<Double,V> openList

Open nodes of the frontier.

vertexToHeapNodeMap

final Map<V,org.jheaps.AddressableHeap.Handle<Double,V>> vertexToHeapNodeMap

closedList

final Set<V> closedList

Closed nodes of the frontier.

gScoreMap

final Map<V,Double> gScoreMap

Tentative distance to the vertices in tha graph computed so far.

cameFrom

final Map<V,E> cameFrom

Predecessor map.

Constructor Details

AStarSearchFrontier

AStarSearchFrontier(Graph<V,E> graph,
 V endVertex,
 AStarAdmissibleHeuristic<V> heuristic)

Method Details

updateDistance

void updateDistance(V v,
 E e,
 double tentativeGScore,
 double fScore)

getDistance

double getDistance(V v)

Description copied from class: BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier

Returns distance to vertex v computed so far.

Specified by:

getDistance in class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>

Parameters:

v - vertex

Returns:

distance to v

getTreeEdge

E getTreeEdge(V v)

Description copied from class: BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier

Returns edge which connects v to its predecessor in the shortest paths tree of this frontier.

Specified by:

getTreeEdge in class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>

Parameters:

v - vertex

Returns:

edge in shortest paths tree