Open Source Routing Machine （OSRM）计算图像中最短的路径。coherentlyIt被设计很好运行与地图数据Openstreetmap项目。-Open Source Routing Machine computes shortest paths in a graph. It was designed to run well with map data the Openstreetmap Project.

路径搜索，最短路径问题，A算法，容易实现，c++程序-Search path, the shortest path problem, A algorithm, easy to implement, c++ program

路径搜索，最短路径问题，A算法，容易实现，c++程序-Search path, the shortest path problem, A algorithm, easy to implement, c++ program

蚁群算法解决TSP问题。通过蚁群算法解决一个城市的结合以及城市之间的旅行代价，寻找经过每个城市一次且仅一次而最终返回的旅行最小代价，及寻找最短路径。-Ant colony algorithm to solve TSP problem. Through the combination of ant colony algorithm to solve a city and cost of travel between cities, seeking after each city once and