Interesting idea. I wish there were some visualizations for some real world graphs.
For the lazy, in a control flog graph (CFG) or a directed acyclic graph (DAG), a node, A, is said to "dominate" another node, B, if all paths from the source node go through A on the way to B [0].
The article is advocating to visualize dependency graphs by focusing on dominators.
For the lazy, in a control flog graph (CFG) or a directed acyclic graph (DAG), a node, A, is said to "dominate" another node, B, if all paths from the source node go through A on the way to B [0].
The article is advocating to visualize dependency graphs by focusing on dominators.
[0] https://en.wikipedia.org/wiki/Dominator_(graph_theory)