joris
/
maximum-weight-matching
1
0
Fork 0
Code Pull Requests Activity

Fix README

This commit is contained in:
Joris van Rantwijk 2024-07-11 21:28:41 +02:00
parent 6bf04df77b
commit e2f5b63a01
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -7,7 +7,7 @@ For an edge-weighted graph, a _maximum weight matching_ is a matching that achie
the largest possible sum of weights of matched edges.
The code in this repository is based on a variant of the blossom algorithm that runs in
_O(n*m*log(n))_ steps.
_O(n \* m \* log(n))_ steps.
See the file [Algorithm.md](doc/Algorithm.md) for a detailed description.