Class AStarSearch<V,W>

java.lang.Object

org.episteme.core.mathematics.discrete.AStarSearch<V,W>

public class AStarSearch<V,W>
extends Object

A* search algorithm for heuristic-guided shortest path finding.

More efficient than Dijkstra when a good heuristic is available. Requires non-negative edge weights.

Since:

1.0

Author:

Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

Constructor Summary

Constructors

Constructor	Description
AStarSearch(GraphWeightAdapter<W> weightAdapter, AStarHeuristic<V,W> heuristic)

Method Summary

Modifier and Type	Method	Description
ShortestPathResult<V,W>	findPath(WeightedGraph<V,W> graph, V source, V goal)	Finds shortest path from source to goal using A* search.
static <V> AStarSearch<V,Double>	ofDouble(AStarHeuristic<V,Double> heuristic)

Methods inherited from class Object

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

Constructor Details

AStarSearch

public AStarSearch(GraphWeightAdapter<W> weightAdapter,
 AStarHeuristic<V,W> heuristic)

Method Details

ofDouble

public static <V> AStarSearch<V,Double> ofDouble(AStarHeuristic<V,Double> heuristic)

findPath

public ShortestPathResult<V,W> findPath(WeightedGraph<V,W> graph,
 V source,
 V goal)

Finds shortest path from source to goal using A* search.

Parameters:

graph - the graph

source - source vertex

goal - goal vertex

Returns:

result containing path and distance