From 1c048e4ab29a1a46aae56f30c544160dae2f92b6 Mon Sep 17 00:00:00 2001
From: Kirito <1362050620@qq.com>
Date: Mon, 22 Aug 2016 14:35:18 +0800
Subject: [PATCH] Update SPFA.cpp

---
 .ACM-Templates/SPFA.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.ACM-Templates/SPFA.cpp b/.ACM-Templates/SPFA.cpp
index f073cd7..21d048f 100644
--- a/.ACM-Templates/SPFA.cpp
+++ b/.ACM-Templates/SPFA.cpp
@@ -5,7 +5,7 @@ const int MAXN = 1005;
 int d[MAXN];/// distance [ From S to ... ]
 int v[MAXN];/// visit
 int q[MAXN];/// 基于数组的队列(也可用queue等...)
-int mp[MAXN][MAXN]; /// mp[i][j] ???<--> j ?? ?1??
+int mp[MAXN][MAXN]; /// mp[i][j] i<--> j is connected.
 int n;/// n is the number of max Point .
 
 void spfa(int StartPoint) /// d[i] is the min distance from StartPoint to i ( Both >=1 )