From f30887fb047cce0b44c9c2f6955a1c73d386b6d9 Mon Sep 17 00:00:00 2001
From: mgt <mgt@oi-wiki.org>
Date: Sun, 3 Jan 2021 19:17:15 +0800
Subject: [PATCH] Update docs/topic/graph-matching/bigraph-weight-match.md

---
 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 d51cac83..0ee28013 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 \{ w(i, j)\  \text{for}\  j = 1\  \text{to}\  n\}, ly(i) = 0$ 
+lx(i) = \max_{1\leq j\leq n} \{ w(i, j)\},\, ly(i) = 0
 
 然后选一个未匹配点，如同最大匹配一样求增广路。找到增广路就增广，否则，会得到一个交错树。
 
-- 
2.11.0