modify

a955e26c · 宋海霞 · 19ac28ce · a955e26c
--- a/main.c
+++ b/main.c
@@ -5,7 +5,7 @@ ShortPath SPath;
 int main(int argc, char* argv[])
 {
 	//
-	// 初始化图(图的邻接矩阵表示法)
+	// Initialization graph (adjacency matrix representation of graph)
 	//
 	GraphMatrix Graph = {{
 						 	{   0,  50,  10, MAX,  45, MAX},
@@ -17,7 +17,7 @@ int main(int argc, char* argv[])
 						}};
 	//
-	// 最短路径(佛洛伊德算法)
+	// Shortest path (Floyd algorithm)
 	//	
 	Floyd(&Graph, &SPath);
@@ -31,11 +31,11 @@ int main(int argc, char* argv[])
 /*
 function:
-	最短路径的佛洛伊德算法
+	The Floyd algorithm for shortest paths
 parameter:
-	pPath -- 结构体指针
+	pPath -- Structure pointer
-	pGraph -- 图指针
+	pGraph -- Figure pointer
 */
 void Floyd(GraphMatrix* pGraph, ShortPath* pPath)
 {