Results for “Std.Graph.roots”

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

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

  The nodes that nothing points at, which is where a topological walk begins.

  fn · Std.Graph