Std.Graph.shortestPath
1 declaration
fn
shortestPath: &Std.Graph.Graph[N] -> N -> N -> Option[Array[N]] where N: OrdThis is a callable function.
What it does
The shortest path from one node to another counted in edges, or None when
there is no way through.
Read the signature
- The text after the name is the type checked by Pudu.
- Read arrows from left to right: inputs come first, and the final type is returned.
- & borrows a value for this call instead of moving or copying it.
- Names inside [ ] are type arguments, such as the item type held by a collection.
- Option holds Some(value) or None when no value is available.
