cycle-analysis-of-directed-acyclic-graph

Analyze hierarchical DAG-like systems by separating undirected substrate from ordering metadata, then classifying diamonds, mixers, shortcuts, and hidden cycle structure. Use for workflow architecture, citation or genealogy DAG comparison, and information-flow diagnosis. NOT for ordinary cycle detection in arbitrary graphs, one-node runtime debugging, or systems with no real ordering constraint.