Description: 2, breadth-first search graph traversal algorithm: First visit to the designated start vertex V0, starting from V0, V0 visit was not visited all the vertices adjacent to W1, W2 ... ..., Wk, and then followed from the W1, W2 ... ..., Wk, the visit they all have not been visited adjacent vertex, and so on, until the map has not been visited by all adjacent vertices have been visited so far.
To Search:
- [mapsearchstrategy.Rar] - use a Java artificial intelligence plans
- [shortestway] - Data structure to achieve the shortest p
- [18BFS] - VC++ Achieve breadth-first traversal, BF
- [9gongtu] - Nine-palace map code, an algorithm is ve
- [SellBuy] - Producers and consumers of the problem s
- [tgdbl] - For a given arbitrary value of edges and
File list (Check if you may need any files):
Download