showing the Node-symbol and a reduced rendering of either the predecessor or a collection of source nodes. For this we need functionality to traverse the node graph depth-first and collect all leaf nodes (which are the source nodes without predecessor); such can be implemented with the help of the expandAll() functionality of `lib::IterExplorer`. In addition we need to collect, sort and deduplicate all the source-node specs; since this is a common requirement, a new convenience builder was added to `lib::IterExplorer` |
||
|---|---|---|
| .. | ||
| application | ||
| steam | ||
| vault | ||
| DIR_INFO | ||