randomized-hopcroft-karp/dist/main.d.ts

An algorithm for maximum cardinality matching of bipartite graph

export default function findMatching(m: number, // number of nodes U
n: number, // number of nodes V
edges: [number, number][], // edges between U and V
groups?: number[]): [number, number][];