3 ms·
If you code in .NET, please try my graph library Arborescence [1]. It's small and not very feature-rich. However, I believe it provides a good separation betwee
by Ptitselov 3y ago
If you code in .NET, please try my graph library Arborescence [1]. It's small and not very feature-rich. However, I believe it provides a good separation between abstractions [2], algorithms, and data structures.
Regarding the points mentioned in the article:
- you can use the edges with or without their own identity,
- you can use implicit graphs unfolded on the fly,
- you can use both adjacency (out-neighbors) and incidence (out-edges + head) interfaces,
- no edge type is emposed by the library, although it does provide the basic tail-head-pair structure as a utility.
[1] https://github.com/qbit86/arborescence https://github.com/qbit86/arborescence
[2] https://github.com/qbit86/arborescence/tree/develop/src/Arborescence.Abstractions https://github.com/qbit86/arborescence/tree/develop/src/Arbo...