pathfinding
pathfinding copied to clipboard
evenfurther
Pathfinding library for rust
Hi there, It is known that Kruskal's algorithm for finding MST, has a simpler implmentation than Prim's and also is more efficient for sparse graph. If it is needed, I'm...
The problem im trying to solve is for astar calls that run forever. This typically happens when the target is unreachable (enclosed in walls, or on an unreachable tile, etc)....
Hi, Apologies for the delay. I added a basic implementation with random cost matrices that compare to the hungarian algorithm. I'll add benchmarks, but I think I'll create a non-criterion...
Requires MSRV to be bumped to 1.81.0.
Hello, Any plans on allowing more flexible support for custom heap allocations through bumpalo or the official WIP allocator API? It is a bummer that if you write your game's...
Hey, while running in debug mode I got a panic in the astar implmentation due to overflow. ``` thread 'Async Compute Task Pool (0)' panicked at /Users/choc/.cargo/registry/src/index.crates.io-6f17d22bba15001f/pathfinding-4.10.0/src/directed/astar.rs:140:33: attempt to add...
Right now, the various algorithms in which arithmetic operations happen may panic if, for example, bounds are exceeded. Using saturating arithmetic is not possible because it could silently yield incorrect...
According to the `kuhn_munkres` docs, the maximum weight matching has the restriction, *between two disjoint sets*. With respect to [maximum weight matching](https://en.wikipedia.org/wiki/Maximum_weight_matching), this is a special case of the assignment...
In many practical applications, the exact length $\mu$ of the non-cyclic prefix of a cyclic function really doesn't matter, and having to re-traverse the sequence again only to find that...
Currently the A* implementation in this crate doesn't support a tie-breaking function, which would allow customizing the behavior when several nodes at the front of the queue share the same...
