Hi, Does anyone know of a BGL or other generic and free C++ implementation of a maximum weighted matching algorithm for general (non-bipartite) graphs? LEDA has the algorithm but the license is restrictive. A C implementation of maximum matching for undirected graphs in an adjacency-list format is available from ftp://dimacs.rutgers.edu/pub/netflow/matching/weighted/solver-1 Regards, Mikko