宽度优先算法(国外英语资料).docVIP

宽度优先算法(国外英语资料) Breadth first search Encyclopedia card Breadth-first search algorithm (also called the breadth-first search) is one of the most simple graph search algorithm, this algorithm is also a lot of important figure of the prototype of the algorithm. The Dijkstra single-source shortest path algorithm and the Prim minimum generation tree algorithm both adopt the same idea as the width first search. The nickname is also called BFS, which is a blind search method to systematically expand and examine all nodes in the diagram to find the results. In other words, it doesnt consider the possible location of the results, and thoroughly searches the entire map until it finds the result. directory An overview of the Explain in detail Pseudo code implementation To optimize the conclusion Edit this section overview BFS, the English full name is the Breadth First Search. BFS does not use the empirical rule algorithm. From the point of view of the algorithm, all child nodes that are obtained because of the expansion node are added to an advanced first queue. General experiment, has not yet been tested its neighbor node is placed in a known as the open container (such as the queue or list), while being tested node is placed in known as a closed container. (open, closed table) Edit this section for detailed explanation Known graph G = (V, E), and a source vertex s breadth first search in the search for a G in a systematic way, so as to discover s can reach all the vertices, and calculate the s to all these vertex distance (the minimum number of edges), the algorithm can generate a tree root at the same time as s and include all of the width of the vertex priority in the tree. The path from s to v is the shortest path from s to v in the path of s to v from s to v, the shortest path from s to v, which is the path of the least edge number. The algorithm also applies to the directed graph and the undirected graph. Call it a breadth-first algorithm because from beginning to end