資料結構-圖-C語言-鄰接矩陣-圖的遍歷

bool visited[999];

void visit(Vertex V) {
	printf("正在訪問頂點%d\n", V);
}

bool isEdge(MGraph graph, Vertex v, Vertex w) {
	return graph->G[v][w] > 0;
}

void BFS(Vertex start, MGraph graph, void(*visit)(Vertex v)) {
	Queue q;
	Vertex v, w;

	q = createQueue(999);
	visit
 
(start);
	visited[start]=true;
	addQueue(q,s);
	
	while(!isEmpty(q)){
		v=deleteQueue(q);
		for(w=0;w<graph->nv;w++){
			if(!visited[w]&&isEdge(graph,v,w)){
				visit(w);
				visited[w]=true;
				addQueue(q,w);
			}
		}
	}
}