Extracting Trees/DAG from a cyclic graph

Question

Given a directed cyclic graph, how do I get various DAGs/trees, which are representative of the input graph? In effect, I'd like to extract various trees from the given circuit (directed & cyclic) graph.

score 0 · Answer 1 · answered Jul 23 '13 at 17:13

0

It depends on your requirement. If you only want to have the highest weight DAG, I think you can try to sort all the edges, then remove edges one by one in that order if the edge breaks a cycle.

answered Jul 23 '13 at 17:13

chepukha

2,371
3
28
40

score 0 · Answer 2 · answered Jan 05 '12 at 18:29

0

Use Prim or Kruskal's algos.
See summary: http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Graph/Undirected/

answered Jan 05 '12 at 18:29

Adrian

5,603
8
53
85

Extracting Trees/DAG from a cyclic graph

2 Answers2