I am looking for an algorithm that clusters a directed graph into a set of clusters that form a directed acyclic graph.For example, given:nodes: {A, B, C, D}with edges: {(A,B), (B,A), (A,C), (C,D), (D,C)}A valid output would be: {{A,B},{C,D})An invalid output would be: {{A,C},{B,D}} (since the node edges imply a cycle between the clusters)Thanks for any pointers or suggestions!
Cluster directed graph into DAG
clustering;graphs