Rewrite buildForest in terms of graphs (and strongly-connected
components) This commit rewrites the logic behind `buildForest` to build first a graph, discovering loops in there (via the strongly-connected components machinery) and finally converting the DAG (freshly-made so) into a Forest.
Name | Stage | Failure | ||
---|---|---|---|---|
failed
|
test | Test | ||
|