Package to compute dominators in a DAG (directed acyclic graph)

Is there a Julia package for DAG’s that supports these operations: dominator, postdominator, preorderdfs, postorderdfs?

AbstractTrees looks like it only works for trees not DAG’s (big surprise) and the few graph packages I’ve looked at don’t seem to have the dominator function.

Some basic infrastructure for working with DAGs here: GitHub - Juice-jl/DirectedAcyclicGraphs.jl: Infrastructure for Directed Acyclic Graphs in Julia
But you’ll likely need to write your own functions over the top.

Wonderful! Is there more documentation (paper, talk, other?) on this package?

. Can a graph as shown be represented? Thx.