实验五完成

homework5/test2.cpp

@@ -27,25 +27,25 @@
 using namespace std;
 
 int main() {
-    ListGraph<int> graph=ListGraph<int>();
-    int n,e;
-    cin>>n>>e;
-    for(int i=0;i<n;i++) {
+    ListGraph<int> graph = ListGraph<int>();
+    int n, e;
+    cin >> n >> e;
+    for (int i = 0; i < n; i++) {
         graph.insert(i);
     }
-    int id1,id2;
-    for(int i=0;i<e;i++) {
-        cin>>id1>>id2;
-        graph.connect(id1,id2);
+    int id1, id2;
+    for (int i = 0; i < e; i++) {
+        cin >> id1 >> id2;
+        graph.connect(id1, id2);
     }
-    cout<<"邻接表："<<endl;
-    cout<<graph.to_string()<<endl;
-    cout<<"BFS序列："<<endl;
-    vector<int> bfs=graph.BFS(0);
+    cout << "邻接表：" << endl;
+    cout << graph.to_string() << endl;
+    cout << "BFS序列：" << endl;
+    vector<int> bfs = graph.BFS(0);
     vector<int>::iterator it;
-    for(it=bfs.begin();it!=bfs.end();++it) {
-        cout<<*it<<" ";
+    for (it = bfs.begin(); it != bfs.end(); ++it) {
+        cout << *it << " ";
     }
-    cout<<endl;
+    cout << endl;
     return 0;
 }