![]() |
Satsuma
a delicious .NET graph library
|
Go to the source code of this file.
Classes | |
| class | Satsuma.MaximumMatching |
| Finds a maximum matching in a bipartite graph using the alternating path algorithm. More... | |
Namespaces | |
| package | Satsuma |
1.8.3.1