From e2f5b63a01ef656a41db35e709a4efdf9c986632 Mon Sep 17 00:00:00 2001 From: Joris van Rantwijk Date: Thu, 11 Jul 2024 21:28:41 +0200 Subject: [PATCH] Fix README --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index c74d12e..ef058a5 100644 --- a/README.md +++ b/README.md @@ -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.