Struct ShortestPathWithParent 

pub struct ShortestPathWithParent<G, S, P = RecordParent>
where
    G: GraphBase + VertexMap<S::T>,
    S: ShortestPathSemiRing,
    P: ParentPolicy<G>,
{
    pub dist: <G as VertexMap<S::T>>::Vmap,
    pub parent: P::State,
}

Fields

dist: <G as VertexMap<S::T>>::Vmap

parent: P::State

Implementations

impl<G, S> ShortestPathWithParent<G, S, RecordParent>

where G: GraphBase + VertexMap<S::T> + VertexMap<Option<<G as GraphBase>::VIndex>>, S: ShortestPathSemiRing,

pub fn path_to(&self, graph: &G, target: G::VIndex) -> Option<Vec<G::VIndex>>

Examples found in repository

crates/library_checker/src/graph/shortest_path.rs (line 11)

pub fn shortest_path(reader: impl Read, mut writer: impl Write) {
    let s = read_all_unchecked(reader);
    let mut scanner = Scanner::new(&s);
    scan!(scanner, n, m, s, t, (g, c): @DirectedGraphScanner::<usize, u64>::new(n, m));
    let sp = g.standard_sp_additive().with_parent().dijkstra([s], &c);
    if let Some(path) = sp.path_to(&g, t) {
        iter_print!(writer, sp.dist[t], path.len() - 1; @it2d path.windows(2));
    } else {
        iter_print!(writer, -1);
    }
}