Description: Explore the path
Of the problem: the preparation of procedures, under the map output from 0 to n (1 <= n & & n> = 9) of all paths.
The core of the problem is to find out the law to meet certain conditions recursive, so the design of recursive algorithm. Careful analysis of the law is not difficult to find:
The path from 0 to n from 0 to n-1 of the path, together with n-1 to n path, as well as 0 to n-2 path, together with n-2 to n the path of this
Composed of two parts.to find the path from 0 to n, can be transformed into looking for 0 to n-1 and 0 to n-2 path, which can establish a recursion.
- [experiment.Rar] - A* algorithm to find paths to solve the
- [Bellman_ford] - bellman-ford realized. Can output of eac
- [AOE] - Introduced via the key for the algorithm
- [aca] - Network nodes and all paths in the minim
File list (Check if you may need any files):
探询路径
........\3_14.cpp
........\3_14.dsp
........\3_14.dsw
........\3_14.ncb
........\3_14.opt
........\3_14.plg
........\探询路径.txt
Download