Function dijkstra 

pub fn dijkstra(
    view: &GraphView,
    source: NodeId,
    target: NodeId,
) -> Option<PathResult>

Dijkstra’s Algorithm (Weighted Shortest Path)

Uses edge weights from GraphView if available, otherwise assumes 1.0.