We explore using the discovery of strongly connected components (SCCs) to enhance merged, or individual, graphs.
Marc's Three Loops 
as shared in matrix.
Marc & Kerry's Process as shared in a fork.
An example from sample implementation.
Imported from Arrows: Neighborhood Pathways toward Regeneration
//wiki.ralfbarkow.ch/assets/pages/strongly-connected-components/ssc.html