搜索资源列表
wuxiangtu3
- 无向图的深度优先搜索 无向图的深度优先搜索 无向图的深度优先搜索 -Undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph of the depth-first search
wuxiangtu4
- 无向图的宽度优先搜索 -Undirected graph in breadth-first search of undirected graph breadth-first search
shudegangdushousuo
- 图的广度搜索 输入图的结点数和每个结点的相邻结点就可以得到该图的广度搜索-Breadth of the search graph nodes input graph and each node of the adjacent nodes can be the breadth of the plan search
min_distance
- 算法原理：对由所有绿洲以及起点/终点构成的图,运用广度搜索进行遍历， 同时动态更新图中当前遍历node以及其子节点对应的distance矩阵数据项， 遍历完毕后，distance矩阵中存储的即为各个node到起点的最佳路线距离。 -Algorithm: all the Oasis, as well as by the origin/destination consisting of maps, use to traverse the breadth of search, at t
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计，包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
prologSearch
- Implementing Search in Prolog. How to represent the problem Uninformed Search depth first breadth first iterative deepening search Informed Search Hill climbing Graph Search
java_webspider
- java实现的网络爬虫,可以生成节点图，非常强大，也很好用。-java implementation of the Web crawler can generate a graph of nodes, very powerful, just as well.