##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Choosing the right algorithm)
You have learned four shortest-path algorithms: BFS, Dijkstra, Bellman-Ford, and Floyd-Warshall. Each solves different problems.
In this section, I'll teach you how to pick the right algorithm based on graph properties. You will solve five problems that require different approaches.
By the end, you will recognize which algorithm fits each situation without hesitation.
