From bd7968733e05cf0d03862c12a1dd7cd9501d4326 Mon Sep 17 00:00:00 2001
From: Joris van Rantwijk <joris@jorisvr.nl>
Date: Thu, 11 Jul 2024 21:28:13 +0200
Subject: [PATCH] fix

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 5e83a2c..8f1e3da 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.