Graph data structure library aspiring to be convenient, versatile, correct and performant.
Graph data structure library aspiring to be convenient, versatile, correct and performant.
Consider changing `add_edge(src, dst, e)` to `add_edge(e: impl IntoEdge)`
Combine with petgraph somehow?
How to do reverse shortest paths on AdjMatrix?
Do not use graph type in algorithm results generic types
Implement a recent shortest paths algorithm
Override default implementations by more efficient ones where it makes sense
Study `graphene` crate for inspiration
Benchmark automatic algorithm selection
Return an edge that is part of a negative cycle in Bellman-Ford
Validate applicability of gryf on top reverse dependencies of petgraph