Edmonds' blossom algorithm: a maximum matching in any undirected graph, by shrinking odd cycles into single vertices and expanding them again on the way out.
This interactive visualization needs JavaScript.