{"repo":"evenfurther/pathfinding","free":true,"listed":false,"github":"https://github.com/evenfurther/pathfinding","clone":"git clone https://github.com/evenfurther/pathfinding.git","description":"Pathfinding library for rust","language":"Rust","stars":1070,"topics":["pathfinding","graph","edmonds-karp","kuhn-munkres","dijkstra","astar","hacktoberfest","rust"],"license":null,"category":"dev-tools","readme_excerpt":"pathfinding This crate implements several pathfinding, flow, and graph algorithms in Rust. The algorithms are generic over their arguments. See the documentation for more information about the various algorithms. Using this crate In your Cargo.toml , put: You can then pull your preferred algorithm (BFS in this example) using: Example We will search the shortest path on a chess board to go from (1, 1) to (4, 6) doing only knight moves. Working with Graphs If you want to use this library with traditional graph structures (nodes, edges, and weights), see the Graph Guide for comprehensive examples showing: - How to represent graphs (adjacency lists, adjacency matrices, edge lists) - Using A and Dijkstra with weighted graphs - Using BFS and DFS with unweighted graphs - Practical examples for spatial shortest paths - Converting from other languages (R, Python) - Tips and best practices License This code is released under a dual Apache 2.0 / MIT free software license. Benchmarking This repository includes two types of benchmarks: Wall-time Benchmarks (Criterion/CodSpeed) Traditional wall-time benchmarks using Criterion (with CodSpeed compatibility) are located in benches/ with names like algos.rs , edmondskarp.rs , etc. These can be run with: Deterministic Benchmarks (iai-callgrind) For more precise and deterministic performance measurements, we use iai-callgrind which counts CPU instructions, cache hits/misses, and estimated cycles using Valgrind. These benchmarks are prefixed with","default_branch":null,"files":null,"tree":[],"storefront":"/r/evenfurther","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/evenfurther/pathfinding/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}