Convert cyclic directed graph to tree (Arborescence)

Asked Oct 06 '15 at 13:39

Active Oct 06 '15 at 14:06

Viewed 893 times

I have this requirement, where I want to convert a directed cyclic graph into a tree given 1 vertex, which will be the root.

From my research I found out that I need to create an Arborescence, which HAS to be acyclic, in order to convert it into a tree. Is it impossible to create a directed rooted tree from a cyclic directed graph?

Here's an example of the vertexes and its edges.

edited Oct 06 '15 at 14:06

Vogel612

5,620
5
48
73

asked Oct 06 '15 at 13:39

Alex Arvanitidis

4,403
6
26
36

1

The generated tree will have an infinite depth, but can be lazily produced at runtime. – Jephron Oct 06 '15 at 14:21

Convert cyclic directed graph to tree (Arborescence)

0 Answers0