Results for “Std.Graph.Graph”

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

• Std.Graph.Graph

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

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

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

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

  A graph with nothing in it.

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

  A graph built from a list of edges.

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

  Whether following edges can lead back to where it started.

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

  Whether there is an edge from one node to another.

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

  Whether the node is in the graph.

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

  How many edges lead into a node.

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

  The nodes that point at nothing.

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

  The nodes an edge leads to from here.

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

  Every node.

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

  How many nodes there are.

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

  How many edges lead out of a node.

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

  Every node reachable from a starting node, nearest first.

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

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

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

  The graph with every edge turned around.

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

  The groups of nodes that can all reach each other.

  fn · Std.Graph
• Std.Graph.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 · Std.Graph