## 编程人 cdmana.com

### 数据结构-图-广度优先搜索算法(Java语言)

详细的代码可见github：

``https://github.com/AbitGo/myClassWork/tree/master/workspace_ds``

``````package com.company.ch6;

public class GraphFS {
private static boolean[] visited;

//广度优先搜索算法的实现
public static void BFSTraverse(IGraph g) throws Exception {
visited = new boolean[g.getVexNum()];
//全部进行初始化，但是java初始化的时候都是false
for (int v = 0; v < g.getVexNum(); v++) {
visited[v] = false;
}
for (int v = 0; v < g.getVexNum(); v++) {
//如果当前没被访问
if (visited[v] == false) {
BFS(g,v);
}
}
System.out.println();
}

public static void BFS(IGraph g,int v) throws Exception {
//该节点已经被访问过了
visited[v]=true;
System.out.print(g.getVex(v).toString()+" ");
//创建队列
//入队
//当队列不为空时
//队头元素出队，并赋值给u
//w为第一个邻接点，并且依次往下读取
//当当前邻接点还没有被读取的时候，则进行状态的翻转
if(!visited[w]){
visited[w]=true;
System.out.print(g.getVex(w).toString()+" ");
}
}
}
}
}
``````

``````package com.company.ch6;

public class MGraphTest {
public static void main(String[] args) throws Exception {
//无向图
Object[] param1_1_1= {"UDN",5,5,"ABCDE"};
MGraph mGraph1 = new MGraph();
mGraph1.createGraph(param1_1_1,param1_1_2);
GraphFS.BFSTraverse(mGraph1);
GraphFS.DFSTraverse(mGraph1);

//有向图
Object[] param1_2_1= {"UDN",5,5,"ABCDE"};
MGraph mGraph2 = new MGraph();
mGraph2.createGraph(param1_2_1,param1_2_2);
GraphFS.BFSTraverse(mGraph2);
GraphFS.DFSTraverse(mGraph2);
}
}
``````

``````"C:\Program Files\Java\jdk1.8.0_101\bin\java.exe"

A B D E C
A B C E D

A B D E C
A B C E D ``````

Scroll to Top