Mike Gerwitz
e3094e0bad
This is an initial implementation that does not yet produce errors on cycles. Documentation is not yet complete. The implementation is fairly basic, and similar to Petgraph's DFS. A terminology note: the DFS will be ontology-aware (or at least aware of edge metadata) to avoid traversing edges that would introduce cycles in situations where they are permitted, which effectively performs a topological sort on an implicitly _filtered_ graph. This will end up replacing ld::xmle::lower::sort. DEV-13162 |
||
|---|---|---|
| .. | ||
| ontree | ||
| topo | ||
| ontree.rs | ||
| topo.rs | ||