R. Bernstein

Suggest Changes
Learn More
Given is a connected directed acycl ic graph G wi th n nodes, e edges and a un ique root node (i.e. a node hav ing in-degree 0). These propert ies can be tested for easily in O(n + e) space and time.(More)