Devise an algorithm based on DFS to detect whether a digraph is acyclic or not. Implement your algorithm in C++ and check it against the following digraphs.

graph1.txt

======== 6

8

5 0

2 4

3 2

1 2

0 1

4 3

3 5

0 2

graph2.txt

======== 7

11

0 5

0 1

3 5

5 2

6 0

1 4

0 2

3 6

3 4

6 4

3 2