minor(graph-matching): fix path, title

diff --git a/docs/graph/bi-graph.md b/docs/graph/bi-graph.md
index be05f14..fde26c3 100644 (file)
--- a/docs/graph/bi-graph.md
+++ b/docs/graph/bi-graph.md
@@ -29,16 +29,18 @@
 
 ## 应用
 
-### 二分图匹配
+### 二分图最大匹配
 
-#### 二分图最大匹配
+详见 [二分图最大匹配](./graph-matching/bigraph-match.md) 页面。
 
-详见 [二分图最大匹配](../topic/graph-matching/bigraph-match.md) 页面。
+### 二分图最大权匹配
 
-#### 二分图最大权匹配
+详见 [二分图最大权匹配](./graph-matching/bigraph-weight-match.md) 页面。
 
-详见 [二分图最大权匹配](../topic/graph-matching/bigraph-weight-match.md) 页面。
+### 一般图最大匹配
 
-### 一般图匹配
+详见 [一般图最大匹配](./graph-matching/general-match.md) 页面。
 
-详见 [一般图匹配](../topic/graph-matching/general-match.md) 页面。
+### 一般图最大权匹配
+
+详见 [一般图最大权匹配](./graph-matching/general-weight-match.md) 页面。

diff --git a/docs/graph/graph-matching/bigraph-match.md b/docs/graph/graph-matching/bigraph-match.md
index 43d7803..883a624 100644 (file)
--- a/docs/graph/graph-matching/bigraph-match.md
+++ b/docs/graph/graph-matching/bigraph-match.md
@@ -1,7 +1,5 @@
 author: accelsao, thallium, Chrogeek, Enter-tainer, ksyx, StudyingFather, H-J-Granger, Henry-ZHR, countercurrent-time, william-song-shy
 
-# 二分图最大匹配
-
 为了描述方便将两个集合分成左和右两个部分，所有匹配边都是横跨左右两个集合，可以假想成男女配对。
 
 假设图有 $n$ 个顶点， $m$ 条边。

diff --git a/docs/graph/graph-matching/bigraph-weight-match.md b/docs/graph/graph-matching/bigraph-weight-match.md
index 8ee06b8..343d433 100644 (file)
--- a/docs/graph/graph-matching/bigraph-weight-match.md
+++ b/docs/graph/graph-matching/bigraph-weight-match.md
@@ -1,7 +1,5 @@
 author: accelsao, Enter-tainer, guodong2005, StudyingFather, Backl1ght, Chrogeek, H-J-Granger, Henry-ZHR
 
-# 二分图最大权匹配
-
 二分图的最大权匹配是指二分图中边权和最大的匹配。
 
 ## Hungarian Algorithm（Kuhn-Munkres Algorithm）

diff --git a/docs/graph/graph-matching/general-match.md b/docs/graph/graph-matching/general-match.md
index 99508e1..eaba444 100644 (file)
--- a/docs/graph/graph-matching/general-match.md
+++ b/docs/graph/graph-matching/general-match.md
@@ -1,7 +1,5 @@
 author: H-J-Granger, accelsao, Ir1d, Early0v0, Henry-ZHR
 
-# 一般图最大匹配
-
 ## 带花树算法（Blossom Algorithm）
 
 开花算法（Blossom Algorithm，也被称做带花树）可以解决一般图最大匹配问题（maximum cardinality matchings)。此算法由 Jack Edmonds 在 1961 年提出。

diff --git a/docs/graph/graph-matching/general-weight-match.md b/docs/graph/graph-matching/general-weight-match.md
index 56802d1..ffc2b69 100644 (file)
--- a/docs/graph/graph-matching/general-weight-match.md
+++ b/docs/graph/graph-matching/general-weight-match.md
@@ -1,7 +1,5 @@
 author: accelsao, Henry-ZHR
 
-# 一般图最大权匹配
-
 ## 带权带花树
 
 待补。

diff --git a/mkdocs.yml b/mkdocs.yml
index 950b426..7a976b9 100644 (file)
--- a/mkdocs.yml
+++ b/mkdocs.yml
@@ -370,8 +370,8 @@ nav:
       - 图匹配: graph/graph-matching/graph-match.md
       - 增广路: graph/graph-matching/augment.md
       - 二分图最大匹配: graph/graph-matching/bigraph-match.md
-      - 一般图匹配: graph/graph-matching/general-match.md
       - 二分图最大权匹配: graph/graph-matching/bigraph-weight-match.md
+      - 一般图最大匹配: graph/graph-matching/general-match.md
       - 一般图最大权匹配: graph/graph-matching/general-weight-match.md
     - Prufer 序列: graph/prufer.md
     - LGV 引理: graph/lgv.md