pub fn dijkstra( view: &GraphView, source: u64, target: u64, ) -> Option<PathResult>
Dijkstra’s Algorithm (Weighted Shortest Path)
Uses edge weights from GraphView if available, otherwise assumes 1.0.