Method path

src/graph/shortest/dijkstra_sp.rs:147–149

Returns a shortest path from vertex s to vertex t

(&self, s: usize, t: usize)

    /// Returns a shortest path from vertex s to vertex t
    pub fn path(&self, s: usize, t: usize) -> Option<Vec<DirectedEdge>> {
        self.all[s].path_to(t)
    }

    /// Is there a path from the vertex s to vertex t?
    pub fn has_path(&self, s: usize, t: usize) -> bool {