Home /
Expert Answers /
Computer Science /
a-depth-first-search-of-acyclic-directed-graph-might-produce-a-different-number-greater-than-on-at-pa358
Expert Answer
A depth-first search of an acyclic directed graph will not produce a greater number of back edges than a depth-first search of a cyclic directed graph