更新 '答辩.cpp'

答辩.cpp

@@ -206,26 +206,18 @@ LL1:
         goto LL1;
         break;
     case 1:
-        system("pause");
-        system("cls");
         display_num(g);
         goto LL1;
         break;
     case 2:
-        system("pause");
-        system("cls");
         display_all(g);
         goto LL1;
         break;
     case 3:
-        system("pause");
-        system("cls");
         search(g);
         goto LL1;
         break;
     case 4:
-        system("pause");
-        system("cls");
         printf("请输入地点的序号：\n");
         scanf("%d",&k);
         Shortest_Path_Dijkstra(g,k-1,P1,D1);
@@ -240,8 +232,6 @@ LL1:
         goto LL1;
         break;
     case 6:
-        system("pause");
-        system("cls");
         ShortestPath_FLOYD(g,P2,D2);
         for(i=0; i<g.vexnum; i++)
         {
@@ -300,20 +290,14 @@ LL1:
         goto LL1;
         break;
     case 7:
-        system("pause");
-        system("cls");
         add_arc(g);
         goto LL1;
         break;
     case 8:
-        system("pause");
-        system("cls");
         delete_arc(g);
         goto LL1;
         break;
     case 9:
-        system("pause");
-        system("cls");
         update(g);
         goto LL1;
         break;