MCPcopy Create free account
hub / github.com/RobustFieldAutonomyLab/DRL_robot_exploration / astar

Function astar

src/astar.cpp:54–137  ·  view source on GitHub ↗

weights: flattened h x w grid of costs h, w: height and width of grid start, goal: index of start/goal in flattened grid diag_ok: if true, allows diagonal moves (8-conn.) paths (output): for each node, stores previous node in path

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

astar_pathMethod · 0.85

Calls 2

euclidean_distanceFunction · 0.85
NodeClass · 0.85

Tested by

no test coverage detected