I think I have made something quite nice now and I'm excited to get your thoughts on it!

Overview:

fast-graph is a graph implementation in rust that doesn't have as many features as for example petgraph (yet) but it will compensate for that by being highly performant and extensible, which should make it better suited for some applications where performance is critical.

It uses the awesome slotmap crate internally which solves the ABA problem while still having insertions, removals and access to the graph be O(1). The slotmap library mentions graphs as an example use case for the library, but I couldn't find any graph library using slotmap or that looked similar to what I have now created, so I thought that it could finally be an opportunity to share something valuable with the community :)

I also added an optional CategoryGraph feature for grouping nodes based on string categories. For even more performance, the HashMap used for this comes from HashBrown.

There’s also some feature flags to enable serde & specta support, and I plan on adding more features. no-std support would be cool for example.

Check it out here: https://crates.io/crates/fast-graph

PS.: 🚀