From: mgt <mgt@oi-wiki.org>
Date: Thu, 28 Jan 2021 04:34:24 +0000 (+0800)
Subject: Update docs/graph/shortest-path.md
X-Git-Url: http://git.osdn.net/view?a=commitdiff_plain;h=5ccc364dcf9bfad1440a68a2198862c8e93aec11;p=oi-wiki%2Fmain.git

Update docs/graph/shortest-path.md
---

diff --git a/docs/graph/shortest-path.md b/docs/graph/shortest-path.md
index 1fb0db94..60a78ec3 100644
--- a/docs/graph/shortest-path.md
+++ b/docs/graph/shortest-path.md
@@ -270,7 +270,7 @@ for (i = 1; i <= n; i++) {
 }
 ```
 
-或者说一个 `C++` 代码：
+以下是该算法的 C++ 实现
 
 ```C++
 vector<vector<LL>> Ps;     // 图的邻接矩阵