Update docs/graph/shortest-path.md

[oi-wiki/main.git] / docs / graph / shortest-path.md

diff --git a/docs/graph/shortest-path.md b/docs/graph/shortest-path.md
index 1fb0db9..60a78ec 100644 (file)
--- 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;     // 图的邻接矩阵