Skip to content

edmondsBlossom ​

edmondsBlossom(graph) computes a maximum matching in a general undirected graph, including graphs with odd cycles. It accepts an adjacency list or Graph<N, W>.

SignatureReturnsComplexity
edmondsBlossom(graph: usize[][])[usize, usize][]O(V³)
edmondsBlossom(graph: Graph<N, W>)[usize, usize][]O(V³)

The result contains disjoint matched vertex pairs. The order of pairs and the choice among equivalent maximum matchings are not guaranteed.

Example ​

tyrus
import { edmondsBlossom } from "tyrus:algorithm";

const matching: [usize, usize][] = edmondsBlossom([[1], [0], [3], [2]]);
print(matching.length); // 2

Study result ​

tyrus
interface EdmondsBlossomInfo {
    pairs: [usize, usize][];
    cardinality: usize;
    examinedEdgeCount: usize;
    blossomContractionCount: usize;
    augmentingPathSearchCount: usize;
    augmentationCount: usize;
}
tyrus
import { EdmondsBlossomInfo, MatchingInfo, edmondsBlossomInfo } from "tyrus:algorithm";
const graph: usize[][] = [[1], [0], [3], [2]];
const info: EdmondsBlossomInfo = edmondsBlossomInfo(graph);
print(info.pairs); // [[0, 1], [2, 3]]
print(info.cardinality); // 2
print(info.examinedEdgeCount); // 4
print(info.blossomContractionCount); // 0
print(info.augmentingPathSearchCount); // 4
print(info.augmentationCount); // 2