Enum BidirectionalDijkstraOutcome 

pub enum BidirectionalDijkstraOutcome {
    Found(f64, bool, Vec<String>),
    NoPath,
    Contradiction,
    NodeMissing,
}

Outcome of bidirectional_dijkstra_undirected.

Variants

Found(f64, bool, Vec<String>)

A shortest path was found: (length, all_int_on_path, path-as-node-names).

all_int_on_path is true iff every edge weight summed along the path is integer-typed (Int/Bool) or absent (defaulting to int 1) — the condition under which nx returns an int length rather than a float (Python int + float -> float). Computed here from the inner AttrMap value variants so the Python wrapper need not re-read the edge dicts (which would mark the graph attr-dirty and force a resync).

NoPath

No path exists between source and target.

Contradiction

vw_length < dists[dir][w] was observed — nx raises ValueError("Contradictory paths found: negative weights?").

NodeMissing

source or target is not present in the graph (defensive — the Python wrapper already raises NodeNotFound before calling).