图的广度搜索 输入图的结点数和每个结点的相邻结点就可以得到该图的广度搜索-Breadth of the search graph nodes input graph and each node of the adjacent nodes can be the breadth of the plan search

算法原理：对由所有绿洲以及起点/终点构成的图,运用广度搜索进行遍历， 同时动态更新图中当前遍历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

网络节点中最小路径以及所有路径的搜索方法-Network nodes and all paths in the minimum path search method

java实现的网络爬虫,可以生成节点图，非常强大，也很好用。-java implementation of the Web crawler can generate a graph of nodes, very powerful, just as well.