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

学习lucene的很好的一本书，书中详细的介绍了lucene由来以及lucene的核心等.-Lucene study of a very good book introduces in detail the origin of lucene, etc., as well as the core of lucene.