We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 79f04b1 commit c3313a1Copy full SHA for c3313a1
dmsrc/pathfinder.dm
@@ -21,10 +21,10 @@
21
*/
22
#define rustg_add_node_astar(json) RUSTG_CALL(RUST_G, "add_node_astar")(json)
23
24
-/**²
+/**
25
* Remove every link to the node with unique_id. Replace that node by null
26
27
-#define rustg_remove_node_astart(unique_id) RUSTG_CALL(RUST_G, "remove_node_astar")(unique_id)
+#define rustg_remove_node_astar(unique_id) RUSTG_CALL(RUST_G, "remove_node_astar")(unique_id)
28
29
/**
30
* Compute the shortest path between start_node and goal_node using A*. Heuristic used is simple geometric distance
0 commit comments