Description: Algorithm: all the Oasis, as well as by the origin/destination consisting of maps, use to traverse the breadth of search, at the same time dynamically updated graph traversal the current node and its child nodes of the distance matrix corresponding to data items, after traversing, distance matrix each node is stored to the best route from the starting point.
To Search:
File list (Check if you may need any files):
min_distance.doc