A* Pathfinding
PlanPrice: $0.03/callLatency: <2msComplexity: O(E log V)
Quick scenarios
Find the shortest path through a 5-node graph with cost, time, and risk weights. Returns primary path plus 2 alternatives.
Click "Run Algorithm" to see results
cURL
curl -X POST https://oraclaw-api.onrender.com/api/v1/plan/pathfind \
-H "Content-Type: application/json" \
-d '{"nodes":[{"id":"start","cost":0},{"id":"A","cost":10,"time":2,"risk":0.1},{"id":"B","cost":5,"time":4,"risk":0.05},{"id":"C","cost":8,"time":1,"risk":0.2},{"id":"end","cost":0}],"edges":[{"from":"start","to":"A","cost":10,"time":2},{"from":"start","to":"B","cost":5,"time":4},{"from":"A","to":"C","cost":3,"time":1},{"from":"A","to":"end","cost":15,"time":3},{"from":"B","to":"C","cost":8,"time":2},{"from":"C","to":"end","cost":4,"time":1}],"start":"start","end":"end","heuristic":"cost","kPaths":3}'Input Schema
nodes: Array of {id, cost?, time?, risk?}
edges: Array of {from, to, cost?, time?, risk?}
start: string
end: string
heuristic: 'zero' | 'time' | 'cost' | 'risk' | 'weighted'
kPaths: number (for alternatives)
Output Fields
pathtotalCostbreakdownnodesExploredalternativePaths