Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

LMH01/simple_graph_algorithms

Repository files navigation

Current Crates.io Version Current documentation Crates.io Crates.io

simple_graph_algorithms

This library aims to provide simple to use implementations for various algorithms run on graphs.

Algorithms

The following algorithms are currently implemented in this library:

Documentation

The documentation is hosted here on docs.rs.

Changelog

The changelog can be found here

Performance

Algorithm Mean time over 100 runs on a graph with 10,000 nodes and 39,600 edges
Bellman-Ford 2.1883 s
Dijkstra 52.3155 ms

These tests where performed on a Ryzen 5 7600x. Performance might be slower on older hardware.

To run these tests yourself type cargo bench, a full run will take a few minutes.

About

An easy to use graph algorithm library for rust, currently supporting dijkstra and bellman-ford.

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

AltStyle によって変換されたページ (->オリジナル) /