Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/tiagocavalcante/fls-bench
Benchmarks for FLS and Yen algorithm
https://github.com/tiagocavalcante/fls-bench
benchmark fixed-length-search yen
Last synced: 3 days ago
JSON representation
Benchmarks for FLS and Yen algorithm
- Host: GitHub
- URL: https://github.com/tiagocavalcante/fls-bench
- Owner: TiagoCavalcante
- License: mit
- Created: 2022-08-15T02:06:12.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-01-10T19:00:28.000Z (about 1 year ago)
- Last Synced: 2024-12-01T13:48:52.188Z (2 months ago)
- Topics: benchmark, fixed-length-search, yen
- Language: Jupyter Notebook
- Homepage:
- Size: 21.5 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- Funding: .github/FUNDING.yml
- License: LICENSE
Awesome Lists containing this project
README
# fls-bench
Benchmarks for FLS and Yen algorithm
## Where the code come from?
The implementation of Yen's algorithm can be found [here](https://github.com/TiagoCavalcante/yen).
The implementation of the fixed length search can be found [here](https://github.com/TiagoCavalcante/fixed-length-search).
## How to run?
```sh
$ cargo run --release
```
## What is the difference?
As you can see FLS is waaay faster than Yen's algorithm for finding paths with a fixed length in unweighted graphs:
