cpp-graph-dom

This is a tiny, header-only C++20 implementation of the dominator tree algorithm by Lengauer and Tarjan as described in "A Fast Algorithm for Finding Dominators in a Flowgraph" (1979).

This library intentionally does not provide an implementation of directed graphs. Any data structure that satisfies the concept graph_dom::graph can be used. Alternatively, the dominator_tree() constructor can be given an entry node and an object that satisfies the concept graph_dom::successor_function.