Pathfinding library for rust
-
Updated
Jun 30, 2025 - Rust
Pathfinding library for rust
(Kuhn-Munkres) numpy implementation, rectangular matrix is supported (|X| <= |Y|). 100x100000 in 0.153 s.
A C++ demo for Hungarian algorithm (Kuhn-Munkres algorithm).
A Java implementation of the Kuhn–Munkres assignment algorithm (Hungarian Algorithm)
An implementation of the Hungarian Algorithm in C++
A python program to solve assignment problem by the Kuhn–Munkres algorithm (The Hungarian Method).
Advanced algorithms and generic data structures in C
[Undergraduate Independent Study] Optimizing Waiting Times for Seoul Taxi Service for the Disabled Using Multi Attribute Weight Model
Fully functional Hungarian Algorithm implementation in Ada
A implementartion of the Kuhn–Munkres algorithm or Munkres assignment algorithm, also known as the Hungarian Method. This implementation it's entirely in PyTorch
AGT course project on maximum matching in bipartite and general graphs
A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
Kuhn-Munkres (Hungarian) Algorithm Implementation in C++
The ESN Buddy Matcher is a Python tool that pairs local and incoming students based on interests and availability. It utilizes data processing and the Kuhn-Munkres algorithm to create an optimal matching matrix for better student integration.
A quick implementation of Kuhn-Munkres algorithm in Godot 4.3
A C++ graph-based implementation of the Kuhn-Munkres (Hungarian) algorithm.
A simple pathfinding module based on the A-star algorithm
Add a description, image, and links to the kuhn-munkres topic page so that developers can more easily learn about it.
To associate your repository with the kuhn-munkres topic, visit your repo's landing page and select "manage topics."