【摘要】 图的广度优先遍历与树的按层次遍历相似,遍历的思路是对图中的每个顶点进行访问且只访问一次.要遍历图,首先要把图采用某种存储结构存到内存之中.本文采用邻接表存储,并在此基础上进行广度优先遍历.更多还原

【Abstract】 According to graph’s breadth-first-search similar to the tree’s level traverse,train of thought of visited is a visit to every elment of the graph.Moreever,to traverse the graph,first to chart a storage structure save to memory.In this paper,we can save the graph in the way of adjacency list,the operate the breadth-first-search.更多还原