From eb5c64e1d1b17c841288dbaf8a2497e8f4410796 Mon Sep 17 00:00:00 2001
From: guodong <45134816+guodong2005@users.noreply.github.com>
Date: Mon, 4 Jan 2021 18:36:50 +0800
Subject: [PATCH] =?utf8?q?=E4=BF=AE=E5=A4=8D=E4=BA=86=E5=85=AC=E5=BC=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=utf8
Content-Transfer-Encoding: 8bit

---
 docs/topic/graph-matching/bigraph-weight-match.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/topic/graph-matching/bigraph-weight-match.md b/docs/topic/graph-matching/bigraph-weight-match.md
index 0ee28013..bd6e65fb 100644
--- a/docs/topic/graph-matching/bigraph-weight-match.md
+++ b/docs/topic/graph-matching/bigraph-weight-match.md
@@ -35,7 +35,7 @@ author: accelsao
 
 首先初始化一组可行顶标，例如
 
-lx(i) = \max_{1\leq j\leq n} \{ w(i, j)\},\, ly(i) = 0
+ $lx(i) = \max \{ w(i, j)\  \text{for}\  j = 1 \ \text{to} \ n\}, ly(i) = 0$ 
 
 然后选一个未匹配点，如同最大匹配一样求增广路。找到增广路就增广，否则，会得到一个交错树。
 
-- 
2.11.0