Module `Dominator_graph.G`

type directed_graph =
  Flambda2_term_basics.Simple.Set.t Flambda2_term_basics.Simple.Map.t

If (a -> set) belongs to the map, it means that there are edges from a to every element of set. It is assumed that no edge points to a vertex not represented in the map.

type component =

| Has_loop of Flambda2_term_basics.Simple.t list
| No_loop of Flambda2_term_basics.Simple.t

val stable_connected_components_sorted_from_roots_to_leaf : 
  (Flambda2_term_basics.Simple.t * Flambda2_term_basics.Simple.Set.t) list ->
  Flambda2_simplify.Dominator_graph.G.component array

val connected_components_sorted_from_roots_to_leaf : 
  Flambda2_simplify.Dominator_graph.G.directed_graph ->
  Flambda2_simplify.Dominator_graph.G.component array

val component_graph : 
  Flambda2_simplify.Dominator_graph.G.directed_graph ->
  (Flambda2_simplify.Dominator_graph.G.component * int list) array

Module Dominator_graph.G

Module `Dominator_graph.G`