See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
Finding shortest path from source to target node
Dijkstra's algorithm
Cost from start node to current node
Heuristic estimate from current node to target
f(n)=g(n)+h(n)f(n) = g(n) + h(n)f(n)=g(n)+h(n)
Node with lowest f(n)f(n)f(n) value
h(n)=∣x1−x2∣+∣y1−y2∣h(n) = |x_1 - x_2| + |y_1 - y_2|h(n)=∣x1−x2∣+∣y1−y2∣
Grids with horizontal & vertical movement only
h(n)=(x1−x2)2+(y1−y2)2h(n) = \sqrt{(x_1 - x_2)^2 + (y_1 - y_2)^2}h(n)=(x1−x2)2+(y1−y2)2
Never overestimates the actual cost
Algorithm may miss the shortest path
Dijkstra's & Greedy Best-First Search
Select your subjects, and get access to A+ resources today.