Class BidirectionalAStarShortestPath.ReversedGraphHeuristic

java.lang.Object

org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ReversedGraphHeuristic

All Implemented Interfaces:

AStarAdmissibleHeuristic<V>

Enclosing class:

BidirectionalAStarShortestPath<V,E>

class BidirectionalAStarShortestPath.ReversedGraphHeuristic
extends Object
implements AStarAdmissibleHeuristic<V>

Helper class for backward search, since it should operate on the reversed graph.

Field Summary

Fields

Modifier and Type	Field	Description
private final AStarAdmissibleHeuristic<V>	heuristic

Constructor Summary

Constructors

Constructor	Description
ReversedGraphHeuristic(AStarAdmissibleHeuristic<V> heuristic)

Method Summary

Modifier and Type	Method	Description
double	getCostEstimate(V sourceVertex, V targetVertex)	An admissible "heuristic estimate" of the distance from $x$, the sourceVertex, to the goal (usually denoted $h(x)$).

Methods inherited from class Object

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

Methods inherited from interface AStarAdmissibleHeuristic

isConsistent

Field Details

heuristic

private final AStarAdmissibleHeuristic<V> heuristic

Constructor Details

ReversedGraphHeuristic

ReversedGraphHeuristic(AStarAdmissibleHeuristic<V> heuristic)

Method Details

getCostEstimate

public double getCostEstimate(V sourceVertex,
 V targetVertex)

Description copied from interface: AStarAdmissibleHeuristic

An admissible "heuristic estimate" of the distance from $x$, the sourceVertex, to the goal (usually denoted $h(x)$). This is the good guess function which must never overestimate the distance.

Specified by:

getCostEstimate in interface AStarAdmissibleHeuristic<V>

Parameters:

sourceVertex - the source vertex

targetVertex - the target vertex

Returns:

an estimate of the distance from the source to the target vertex