Description:
- Greedy Algorithm approach
- Similar to Uniform Cost Search
How it works?:
- Maintain a set of explored nodes S and the shortest distance to get there
- Example:
- Explore A, distance to B C D
- Explore the shortest neighbor of A, B, then note the neighbors and their distance only if they are shorter than the know distance
- …
| A | B | C | D | E | F |
|---|---|---|---|---|---|
| 0 | |||||
| X | 3 | 5 | 9 | ||
| X | 5 | 3+4 | 3+7 | ||
| X | 5+2 | 3+10 | |||
| X | 5+2+2 | 5+2+2 |