{"id":59157,"library":"pathfinding","title":"Pathfinding","description":"Pathfinding, flow, and graph algorithms for shortest paths and network flows.","status":"active","version":"4.15.0","language":"rust","source_language":null,"source_url":"https://github.com/evenfurther/pathfinding","tags":["pathfinding","graph","algorithms","dijkstra"],"install":[{"cmd":"# Cargo.toml\n[dependencies]\npathfinding = \"4.15.0\"","lang":"toml","label":"Cargo.toml"},{"cmd":"cargo add pathfinding","lang":"bash","label":"cargo add"}],"dependencies":[],"imports":[{"symbol":"dijkstra","correct":"use pathfinding::directed::dijkstra::dijkstra;"}],"quickstart":{"code":"use pathfinding::directed::dijkstra::dijkstra;\n\nfn main() {\n    let successors = |&n: &i32| vec![(n+1, 1), (n*2, 2)];\n    let result = dijkstra(&0, successors, |&n| n == 10);\n    println!(\"Path: {:?}\", result);\n}","lang":"rust","description":"Finds shortest path using Dijkstra's algorithm."},"warnings":[],"env_vars":null,"search_vec":"'algorithm':6,15 'dijkstra':16 'flow':3,12 'graph':5,14 'network':11 'path':9 'pathfind':1,2,13 'shortest':8","created_at":"2026-06-16T16:52:29.367046+00:00","updated_at":"2026-06-16T16:52:29.367046+00:00","problems":[],"ecosystem":"crates","meta_description":null,"install_score":null,"quickstart_score":null,"quickstart_tag":null,"pypi_latest":null,"cli_name":null,"cli_version":null,"type":"library","homepage":"https://rfc1149.net/devel/pathfinding.html","github":"https://github.com/evenfurther/pathfinding","docs":"https://docs.rs/pathfinding/","changelog":null,"pypi":null,"npm":null,"openapi_spec":null,"status_page":null,"smithery":null,"categories":["utility"],"base_url":null,"auth_type":null,"provenance":{"verified_status":null,"verified_at":null,"last_verified":"2026-06-16","next_check":"2026-12-13","install_tag":null}}