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++

All algorithms and datastructures from Introduction to Algorithms (CLRS) in C

A python program to solve assignment problem by the Kuhn–Munkres algorithm (The Hungarian Method).

[Undergraduate Independent Study] Optimizing Waiting Times for Seoul Taxi Service for the Disabled Using Multi Attribute Weight Model

AGT course project on maximum matching in bipartite and general graphs

Fully functional Hungarian Algorithm implementation in Ada

The Kuhn-Munkres Algorithm, Often The Hungarian Method is a Combinatorial Optimisation Algorithm Used to Solve the Optimisation Problem. It Finds the Optimal Assignment in a Weighted Bipartite Graph

A implementartion of the Kuhn–Munkres algorithm or Munkres assignment algorithm, also known as the Hungarian Method. This implementation it's entirely in PyTorch

A quick implementation of Kuhn-Munkres algorithm in Godot 4.3

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 memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java

Kuhn-Munkres (Hungarian) Algorithm Implementation in C++

A simple pathfinding module based on the A-star algorithm

Implementation of Kuhn-Munkres Hungarian Matching Algorithm in modern C++ using Eigen