Merge branch 'master' into master

Author: the1812

src/algorithm_module/c_adapt.cpp

@@ -0,0 +1,17 @@
+#include "algorithm_module.h"
+#define C_PUBLIC extern "C" __declspec(dllexport) //CÓïÑԵĵ¼³ö±ê¼Ç
+namespace GraphAlgorithm
+{
+    typedef int (*_FirstEdgeAdapter)(int idx_v);
+    typedef int (*_NextEdgeAdapter)(int idx_v, int idx_e);
+    typedef int (*_EdgeToAdapter)(int idx_v, int idx_e);
+    PathType bfsResult;
+    C_PUBLIC void RunBfs(int idx_start_v, int idx_dest_v,
+                       _FirstEdgeAdapter firstOf, 
+                       _NextEdgeAdapter nextOf,
+                       _EdgeToAdapter destOf)
+    {
+        bfsResult = bfs(idx_start_v, idx_dest_v, FirstEdgeAdapter(firstOf), NextEdgeAdapter(nextOf), EdgeToAdapter(destOf));
+    };
+
+}

src/test/poj_2251_main.cpp

@@ -52,11 +52,11 @@ GraphAdapter graph = {
 int main() {
 	int start, dest;
 
-	while (scanf("%d%d%d", &t, &a, &b) == 3 && t) {				//长宽高
+	while (scanf_s("%d%d%d", &t, &a, &b) == 3 && t) {				//长宽高
 
 		for (int i = 0; i < t; i++)
 			for (int j = 0; j < a; j++) {
-				scanf("%s", s[i][j]);
+				scanf_s("%s", s[i][j], 1024);
 				for (int k = 0; k < b; k++)
 					if (s[i][j][k] == 'S') { start = encoder(i, j, k); }
 					else if (s[i][j][k] == 'E') { dest = encoder(i, j, k); }