Finds the shortest path over the connectedSpaces graph of a set of symbolic spaces.
Edges are weighted by travel effort, not raw distance: walking time plus stair/elevator
penalties. avoidStairs removes stair connections from consideration (their weight is
infinite), so a wheelchair route uses the elevator when one exists and reports unreachable when
it does not.
Finds the shortest path over the
connectedSpacesgraph of a set of symbolic spaces.Edges are weighted by travel effort, not raw distance: walking time plus stair/elevator penalties.
avoidStairsremoves stair connections from consideration (their weight is infinite), so a wheelchair route uses the elevator when one exists and reports unreachable when it does not.