Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Update SPFA.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-08-22 14:35:18 +08:00 committed by GitHub
parent d308527b16
commit 1c048e4ab2
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.ACM-Templates/SPFA.cpp
View File

@ -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 )