fls-bench

Benchmarks for FLS and Yen algorithm

Where the code come from?

The implementation of Yen's algorithm can be found here.

The implementation of the fixed length search can be found here.

$ cargo run --release

As you can see FLS is waaay faster than Yen's algorithm for finding paths with a fixed length in unweighted graphs:

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
.github		.github
src		src
.gitignore		.gitignore
Cargo.toml		Cargo.toml
LICENSE		LICENSE
README.md		README.md
plot.ipynb		plot.ipynb
rustfmt.toml		rustfmt.toml