From 82a10e5242e2c6291f149a0d0f01d668440240ab Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Wed, 3 Jan 2024 14:29:40 +0800
Subject: [PATCH] 'commit'

---
 TangDou/AcWing_TiGao/T3/Floyd/344.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/TangDou/AcWing_TiGao/T3/Floyd/344.md b/TangDou/AcWing_TiGao/T3/Floyd/344.md
index 2b8e45b..dfe7733 100644
--- a/TangDou/AcWing_TiGao/T3/Floyd/344.md
+++ b/TangDou/AcWing_TiGao/T3/Floyd/344.md
@@ -35,7 +35,7 @@ $1≤N≤100,1≤M≤10000,1≤l<500$
 1 3 5 2
 ```
 
-### 二、$floyd + dp$ 求最小环模板(最少三点)
+### 二、算法思路
 
 ![](https://cdn.acwing.com/media/article/image/2021/12/18/85607_ee5522ae60-g.png)
 
@@ -45,7 +45,7 @@ $floyd$是 **插点** 算法，在点$k$被 **插入前** 可计算$i \rightarro
 枚举所有以$k$为环中 **最大节点** 的环即可。
 
 
-### 三、$floyd+dp$
+#### $Code$
 ```cpp {.line-numbers}
 #include <bits/stdc++.h>