Dom computes the dominator tree from the immediate dominators (as computed by IDom).

DomFrontier returns the dominance frontier of each node in g.

IDom returns the immediate dominator of each node of g.

NewNodeMarks returns a node mark set with no marks set.

PostOrder returns the nodes of g visited in post-order.

PreOrder returns the nodes of g visited in pre-order.

Reverse reverses xs in place and returns the slice.

SCC computes the strongly-connected components of graph g.

SimplifyMulti simplifies a multigraph to a weighted simple graph.

SCCEdges instructs SCC to record edges between components.

SCCSubnodeComponent instructs SCC to record a mapping from subnode to component ID containing that subnode.

DomTree is a dominator tree.

Euler visits a graph using an Euler tour.

NodeMarks is a structure for marking nodes in a graph.

SCCGraph is a set of strongly-connected components of another graph.

SCCFlags is a set of optional analyses to perform when constructing strongly-connected components.