Steps: 0
Iterations: 0
1 let Q be a queue
2 add start node to Q
3 while Q is not empty
4 let current node C be the first element of Q
5 if C has any unvisited neighbors n
6 add n to Q 1 let G be a graph
2 let S be a set of seen nodes
3 let s be the start node
4 set distance from s -> s = 0
5 set distance from s -> any node = ∞
6 while there are nodes from G not in S
7 let the current node c have the smallest distance in S
8 if c has any unvisited neighbors n
get current distance d from c
9 if n is not in S && d + edge(n , c) < distance to n
distance to n = d + edge(n , c)
parent of n = c 1 let G be a graph
2 let S be a set of seen nodes
3 let s be the start node
4 set distance from s -> s = 0
5 set distance from s -> any node = ∞
6 while there are nodes from G not in S
7 let the current node c have the smallest heuristic in S
8 if c has any unvisited neighbors n
get current distance d from c
calculate euclidean hueristic h
9 if n is not in S && d + edge(n , c) < distance to n
distance to n = d + edge(n , c)
heuristic of n = distance to n + h
parent of n = c