simple_graph_algorithms 1.0.0

A library with the goal of making running graph algorithms as easy as possible.
Documentation
  • Coverage
  • 100%
    19 out of 19 items documented7 out of 13 items with examples
  • Size
  • Source code size: 87.19 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 4.41 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 10s Average build duration of successful builds.
  • all releases: 10s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • LMH01/simple_graph_algorithms
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • LMH01

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 will be hosted on docs.rs once the first version has been released to crates.io.

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.