iScript
diff --git a/‎.idea/workspace.xml‎
Lines changed: 19 additions & 21 deletions b/‎.idea/workspace.xml‎
Lines changed: 19 additions & 21 deletions
diff --git a/‎out/production/Graph/BipartitionDetection.class‎
0 Bytes b/‎out/production/Graph/BipartitionDetection.class‎
0 Bytes
diff --git a/‎out/production/Graph/GraphBFS.class‎
2.03 KB b/‎out/production/Graph/GraphBFS.class‎
2.03 KB
diff --git a/‎out/production/Graph/SingleSourcePath.class‎
515 Bytes b/‎out/production/Graph/SingleSourcePath.class‎
515 Bytes
diff --git a/‎src/GraphBFS.java‎
Lines changed: 55 additions & 0 deletions b/‎src/GraphBFS.java‎
Lines changed: 55 additions & 0 deletions
diff --git a/‎src/SingleSourcePath.java‎
Lines changed: 26 additions & 6 deletions b/‎src/SingleSourcePath.java‎
Lines changed: 26 additions & 6 deletions
@@ -0,0 +1,55 @@
+import java.util.ArrayList;
+import java.util.Queue;
+import java.util.LinkedList;
+
+// 广度优先遍历
+public class GraphBFS {
+    private Graph G;
+    private boolean[] visited;
+    private ArrayList<Integer> order = new ArrayList<>(); //先序遍历结果
+
+    public GraphBFS(Graph G){
+        this.G = G;
+        visited = new boolean[G.V()];
+
+        // 多包一层for，防止有多个联通分量
+        for(int v = 0 ;v<G.V();v++){
+            if(!visited[v])
+                bfs(v);
+        }
+    }
+
+    // 广度优先遍历 , 路径同时是最短路径
+    private void bfs(int s){
+        Queue<Integer> queue = new LinkedList<>();  // LinkedList 实现了queue接口
+
+        // 入队并标记访问
+        queue.add(s);
+        visited[s] = true;
+
+        while(!queue.isEmpty()){
+            int v = queue.remove(); //从队列取出元素
+            order.add(v);
+
+            for(int w:G.adj(v)){
+                if(!visited[w]) {
+                    // 入队并标记访问
+                    queue.add(w);
+                    visited[w] = true;
+                }
+            }
+        }
+    }
+
+    public Iterable<Integer> order(){
+        return order;
+    }
+
+    public static void main(String[] args){
+
+        Graph g = new Graph("g.txt");
+        GraphBFS graphBFS = new GraphBFS(g);
+        System.out.println(graphBFS.order());
+    }
+
+}
@@ -1,13 +1,11 @@
-import java.util.ArrayList;
-import java.util.Collection;
-import java.util.Collections;
+import java.util.*;
 
 // 单源路径
 public class SingleSourcePath {
     private Graph G;
     private int s;
     private boolean[] visited;
-    private int[] pre;
+    private int[] pre;  //上一个点
 
 
     public SingleSourcePath(Graph G , int s){
@@ -20,8 +18,8 @@ public SingleSourcePath(Graph G , int s){
         for(int i=0;i<pre.length;i++)
             pre[i] = -1;
 
-        dfs(s,s);
-
+        //dfs(s,s);
+        bfs(s);
     }
 
     // 深度优先遍历
@@ -35,6 +33,28 @@ private void dfs(int v,int parent){
         }
     }
 
+    // 广度优先遍历
+    private void bfs(int s){
+        Queue<Integer> queue = new LinkedList<>();  // LinkedList 实现了queue接口
+
+        // 入队并标记访问
+        queue.add(s);
+        visited[s] = true;
+        pre[s] = s;
+
+        while(!queue.isEmpty()){
+            int v = queue.remove(); //从队列取出元素
+            for(int w:G.adj(v)){
+                if(!visited[w]) {
+                    // 入队并标记访问
+                    queue.add(w);
+                    visited[w] = true;
+                    pre[w] = v;
+                }
+            }
+        }
+    }
+
     // 从源到目标是否可以连接
     public boolean isConnectedTo(int t){
         G.validateVertex(t);