A graph library with a focus on simplicity and efficiency.

This is personal project and features, properties, and APIs are subject to change. Production readiness is not the primary goal.

The goal of the library is to explore the performance characteristics of different representations and their respective implementation in Rust for various algorithms.

The set of provided features is opportunistic. Being comprehensive is currently not a goal.

The vertex set of a graph in this library is a prefix of the natural numbers. There is no support for representing labelings of nodes or edges. The focus is on the core graph representations and the respective algorithms.