An extensible library for Directed Acyclic Graphs multi-targeting .NET Standard (2.0 for ultimate compatability) and .NET 6.
- Check for path existence
- Cycle detection
- Topological sorting
- Satisfiability graph
- Extensible -- inherit/override existing classes as you see fit
- Basic directed acyclical graph: See DagTests.
- Satisfiability graph: See SatisfiabilityGraphTests.
- Provide algorithm for graph traversal with arbitrary operations at each node/edge visit (with cumulative state).
- Better Examples
Based on ociaw's Dagger.