'commit'

TangDou/AcWing_TiGao/T3/Floyd/345.md

@@ -101,9 +101,9 @@ t = [ 14, 11, 14 ]
 
 矩阵乘法 **模板** 如下：
 ```cpp {.line-numbers}
-for (int k = 1; k <= COLS_A; ++k) 
+for (int k = 1; k <= COLS_A; k++) 
-    for (int i = 1; i <= ROWS_A; ++i) 
+    for (int i = 1; i <= ROWS_A; i++) 
-        for (int j = 1; j <= COLS_B; ++j) 
+        for (int j = 1; j <= COLS_B; j++) 
             t[i][j] += a[i][k] * b[k][j];
 ```
 

TangDou/Topic/【Floyd专题】.md

@@ -272,6 +272,10 @@ signed main() {
     }
 }
 ```
+ **练习题**
+ #### [$AcWing$ $344$. 观光之旅](https://www.cnblogs.com/littlehb/p/16033489.html)
+
+
 ### 七、传递闭包
 #### [$HDU$-$1704$ $Rank$](https://acm.hdu.edu.cn/showproblem.php?pid=1704)
 
@@ -393,8 +397,11 @@ int main() {
     return 0;
 }
 ```
+### 九、限定边数量的情况下求多源最短路径
+
+#### [$AcWing$ $345$ 牛站](https://www.cnblogs.com/littlehb/p/16043039.html)
 
-### 九、其它习题
+### 十、其它习题
 
 #### $SSL-1760$（商店选址）
 **题目**