We merge "mechanism" with "workflow" to see the boundary within our tangled layered network.
Imported from Arrows: Assets 
, Programming , Organization , Operation
View in detail full screen. page
digraph { layout=neato; overlap = false; splines=true node [style=filled fillcolor=bisque] "Hosted\nAssets" [penwidth=3] "Program\nAuthor" [penwidth=3] "Work\nStep\nPage" [penwidth=3] "Forked\nPage" [penwidth=3] "Work\nLineup" [penwidth=3] "Work\nLineup" -> "Output\nPage" "Input\nPage" -> "Work\nLineup" "Work\nLineup" -> "Forked\nPage" "Work\nLineup" -> "Work\nStep\nPage" "Forked\nPage" -> "Hosted\nAssets" "Forked\nPage" -> "Forked\nAsset" "Hosted\nAssets" -> "Forked\nAsset" "Work\nStep\nPage" -> "Forked\nPage" "Workflow\nAuthor" -> "Work\nStep\nPage" "Hosted\nAssets" -> "HTML\nScript" "Work\nStep\nPage" -> "Hosted\nAssets" "Program\nAuthor" -> "Browse\nFile" "Program\nAuthor" -> "Hosted\nAssets" "Browse\nFile" -> "HTML\nScript" "Program\nAuthor" -> "HTML\nScript" "Nick\nNiemeir" -> "Assets\nPlugin" "Ward\nCunningham" -> "Assets\nPlugin" "Assets\nPlugin" -> "Hosted\nAssets" "Paul\nRodwell" -> "Hosted\nAssets" "Frame\nPlugin" -> "Hosted\nAssets" }
Aside: We omitted the graphs showing Eric's work because he is so connected that it jumbles the layers that graph layout otherwise discovers.
We rate likely driver tree roots based on the number of in and out links for nodes at intersections.
| Hosted Assets | 6 | 2 |
| Program Author | 0 | 3 |
| Work Step Page | 2 | 2 |
| Forked Page | 2 | 2 |
| Work Lineup | 1 | 3 |