A* Pathfinding
PlanPrice: $0.03/callLatency: <2msComplexity: O(E log V)
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
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