MMP method with A-star heuristic
Computes shortest path between given source and target using MMP method with A-star heuristic. Computes exact shortest paths. The output is a text file containing a sequence of points. To optimize time requirements this code does not maintain the inner frontier queue described in Section 3.4 of
http://www.cs.unc.edu/~verma/shortest_path.pdf .
Example Usage:
General
Usage:
mmp -i input_mesh -o output_path_file -s source_index_number -t target_x_coordinate target_y_coordinate target_z_coordinate
-TOL tolerance_for_target_coordinates
Note: If the input mesh has been ordered using Dijkstra-based reordering, then the index of source is 1.
--
VishalVerma - 16 Dec 2008
Revision: r1.1 - 18 Dec 2008 - 07:32 - Main.guest