Struct SingleSourceDijkstra 

pub struct SingleSourceDijkstra { /* private fields */ }

Find single-source shortest paths to all reachable nodes.

This runs Dijkstra’s algorithm from a single source and returns the shortest distance to all reachable nodes.

Implementations

impl SingleSourceDijkstra

pub fn new(source: EntityId, direction: Direction) -> Self

Create a new single-source Dijkstra finder.

pub fn with_weight_property(self, property: impl Into<String>) -> Self

Set the weight property name to use.

pub fn with_max_weight(self, max_weight: f64) -> Self

Set the maximum total weight to search.

pub fn with_edge_type(self, edge_type: impl Into<EdgeType>) -> Self

Filter to only traverse edges of the specified type.

pub fn compute<T: Transaction>( self, tx: &T, ) -> GraphResult<HashMap<EntityId, (f64, Option<(EntityId, EdgeId)>)>>

Compute shortest distances to all reachable nodes.

Returns

A map from node ID to (distance, parent node, edge used). The source node maps to (0.0, None).