A component library for building and executing directed acyclic graphs. Graphs may be executed sequentially on a single thread or with concurrency. PDAG will execute with the maximum level of concurrency unless a concurrency throttle is specified. https://github.com/myles-mcdonnell/MPM.PDAG
Explore trees and tree-like structures with LINQ using tree-traversal algorithms like breadth-first and depth-first search:
IEnumerable<DirectoryInfo> childDirectories = Traverse.DepthFirst(new DirectoryInfo(...), d => d.EnumerateDirectories());
IEnumerable<DirectoryInfo>...
More information
