Struct AStar 

pub struct AStar;

A* Algorithm for heuristic-guided shortest paths

Use when you have a heuristic estimate of distance to target. Faster than Dijkstra when heuristic is good. Time: O((V + E) log V) typical, Space: O(V)

Implementations

impl AStar

pub fn shortest_path<H>( graph: &GraphStore, source: &str, target: &str, heuristic: H, ) -> ShortestPathResult

where H: Fn(&str, &str) -> f64,

Find shortest path using A* with a custom heuristic

The heuristic function estimates distance from a node to the target. Must be admissible (never overestimate) for optimal paths.

pub fn shortest_path_no_heuristic( graph: &GraphStore, source: &str, target: &str, ) -> ShortestPathResult

A* with zero heuristic (equivalent to Dijkstra)