Dijkstra's method with A-star heuristic
Computes shortest path between given source and target using Dijkstra's method with A-star heuristic. Computes shortest paths on the edges of the mesh. The output is a text file containing a sequence of points.
Example Usage:
General
Usage:
dijkstra_order -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
--
VishalVerma - 17 Dec 2008
to top