Results for “Std.Graph.shortestPath”

Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.

• Std.Graph.shortestPath&Std.Graph.Graph[N] -> N -> N -> Option[Array[N]] where N: Ord

  The shortest path from one node to another counted in edges, or None when

  fn · Std.Graph