The cost array of bellman-ford algorithm should be the previous time record

[BWbwchen]

Coding_Practice/data_structure/Graph.cpp

Lines 353 to 359 in 514d728

	for (int adjecent = 0; adjecent < vertex; ++adjecent) {
	if (graph[n][adjecent] != MAXN &&
	cost[n] + graph[n][adjecent] < cost[adjecent] ) {
	pi[adjecent] = n;
	cost[adjecent] = cost[n] + graph[n][adjecent];
	}
	}