摘要:
Depth-first search:访问顺序: A, B, D, F, E, C, G.PseudocodeInput: A graph G and a vertex v of GOutput: A labeling of the edges in the connected component of v as discovery edges and back edges1 procedure DFS(G,v):2 label v as explored3 for all edges e in G.adjacentEdges(v) do4 if edg... 阅读全文
posted @ 2013-02-24 10:49
wouldguan
阅读(202)
评论(0)
推荐(0)
浙公网安备 33010602011771号