Problems Base course RU

Method

meet in the middle

Articles

GRA Algorithm Bidirectional search Two Dijkstra waves towards each other: where to stop, how much is saved, and how to make it work with A*. O((V + E) log V) 2 problems

Problems

Changes of plane

Often together

shortest path 1 heap 1 weighted graph 1 graph 1 maps and navigation 1 heuristic 1 social graphs 1 interviews 1