Notes on oriented depth-first search and longest paths
Simple acyclic directed graphs having a depth-first search tree with no cross edges are characterized; this leads to a linear time algorithm for finding such a DFS tree, via a reduction to the longest path problem in such digraphs. Applications to drawing flowcharts are outlined.
scientific article; zbMATH DE number 4095499