Std.Graph

22 public declarations

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

  The graph with an edge from one node to another.

  fn
• addNode&Std.Graph.Graph[N] -> N -> Std.Graph.Graph[N] where N: Ord

  The graph with a node in it, whether or not it has any edges.

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

  The groups of nodes joined to each other when direction is ignored.

  fn
• emptyStd.Graph.Graph[N] where N: Ord

  A graph with nothing in it.

  fn
• fromEdges&Array[(N, N)] -> Std.Graph.Graph[N] where N: Ord

  A graph built from a list of edges.

  fn
• Graph

  A directed graph: nodes, and the edges leading out of each one.

  type
• hasCycle&Std.Graph.Graph[N] -> Bool where N: Ord

  Whether following edges can lead back to where it started.

  fn
• hasEdge&Std.Graph.Graph[N] -> N -> N -> Bool where N: Ord

  Whether there is an edge from one node to another.

  fn
• hasNode&Std.Graph.Graph[N] -> N -> Bool where N: Ord

  Whether the node is in the graph.

  fn
• inDegree&Std.Graph.Graph[N] -> N -> Int where N: Ord

  How many edges lead into a node.

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

  The nodes that point at nothing.

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

  The nodes an edge leads to from here.

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

  Every node.

  fn
• order&Std.Graph.Graph[N] -> Int where N: Ord

  How many nodes there are.

  fn
• outDegree&Std.Graph.Graph[N] -> N -> Int where N: Ord

  How many edges lead out of a node.

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

  Every node reachable from a starting node, nearest first.

  fn
• reaches&Std.Graph.Graph[N] -> N -> N -> Bool where N: Ord

  Whether one node can be reached from another by following edges.

  fn
• reversed&Std.Graph.Graph[N] -> Std.Graph.Graph[N] where N: Ord

  The graph with every edge turned around.

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

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

  fn
• 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
• stronglyConnected&Std.Graph.Graph[N] -> Array[Array[N]] where N: Ord

  The groups of nodes that can all reach each other.

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

  The nodes in an order where every node comes before the ones it points at,

  fn