A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.

A Reason implementation of the blossom maximum-matching algorithm

Application of Ford-Fulkerson algorithm to find the maximum matching between 2 sides of a bipartite graph

Graph theory for car-pool problem

A ReScript implementation of the blossom maximum-matching algorithm.

An implementation of the blossom algorithm for constructing maximum matchings on graphs.

程序用于中文语句的分词，实现基于最大匹配算法的前向、后向和双向分词技术，并提供了接口，具体下面介绍。

AGT course project on maximum matching in bipartite and general graphs

Find maximum matchings in an arbitrary bipartite graphs with Node.js and React.js

The Maximum Matching algorithm finds the largest possible set of edges in a graph with no common vertices. It has applications in computer science, mathematics, and operations research and can be solved efficiently with algorithms such as augmenting path and Hopcroft-Karp with a time complexity of O(E√V).

Design of Algorithms Projects - Sharif University of Technology - Spring 2021

Some demo tokenizers especially for Chinese, including Maximum Matching, UniGram, HMM, CRF.

NYCU Game Theory and Its Applications Fall 2023

Simple application to visualize Blossom algorithm (introduced by Jack Edmonds)

An application to demonstrate an algorithm for finding maximum matchings in bipartite graphs.