{"id":17134567,"url":"https://github.com/tiagocavalcante/fixed-length-search","last_synced_at":"2025-08-21T08:10:50.916Z","repository":{"id":53854407,"uuid":"521470799","full_name":"TiagoCavalcante/fixed-length-search","owner":"TiagoCavalcante","description":"The fastest algorithm for finding a path with a specific length in a graph","archived":false,"fork":false,"pushed_at":"2024-01-10T18:38:08.000Z","size":49,"stargazers_count":3,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-29T11:51:11.107Z","etag":null,"topics":["algorithms","graph","path-search-algorithm"],"latest_commit_sha":null,"homepage":"https://crates.io/crates/fixed-length-search","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/TiagoCavalcante.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null},"funding":{"github":["TiagoCavalcante"],"patreon":null,"open_collective":null,"ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"otechie":null,"lfx_crowdfunding":null,"custom":null}},"created_at":"2022-08-05T01:56:23.000Z","updated_at":"2023-12-02T13:58:56.000Z","dependencies_parsed_at":"2024-12-02T02:37:59.396Z","dependency_job_id":null,"html_url":"https://github.com/TiagoCavalcante/fixed-length-search","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TiagoCavalcante%2Ffixed-length-search","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TiagoCavalcante%2Ffixed-length-search/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TiagoCavalcante%2Ffixed-length-search/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TiagoCavalcante%2Ffixed-length-search/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TiagoCavalcante","download_url":"https://codeload.github.com/TiagoCavalcante/fixed-length-search/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245217946,"owners_count":20579300,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","graph","path-search-algorithm"],"created_at":"2024-10-14T19:45:08.007Z","updated_at":"2025-03-24T06:16:57.588Z","avatar_url":"https://github.com/TiagoCavalcante.png","language":"Rust","funding_links":["https://github.com/sponsors/TiagoCavalcante"],"categories":[],"sub_categories":[],"readme":"# fixed-length-search\n\nThe fastest algorithm for finding a path with a specific length in a graph\n\n## How to run?\n\n```sh\n$ cargo install fixed-length-search\n$ fixed-length-search\n```\n\n## How fast is it?\n\nHere is the output of the benchmark of the algorithm for a graph with 10 thousand vertices and density of 0.1:\n```\nFill the graph - 250.07ms\nFixed length search - 19.52ms\nThe path is valid\n```\n\nYep, that is milliseconds, not seconds.\n\nYou can find a better benchmark [here](https://github.com/TiagoCavalcante/fls-bench).\n\n## How does it work?\n\nThis is a mix of the ideas used in meet-in-the-middle search and BFS, there are lots of comments in the code that explains each aspect of this algorithm. You can find an animation that may help you to understand this algorithm [here](https://github.com/TiagoCavalcante/fls-animation).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftiagocavalcante%2Ffixed-length-search","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftiagocavalcante%2Ffixed-length-search","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftiagocavalcante%2Ffixed-length-search/lists"}