Multiple choice Which of the following is a routing algorithm with the shortest delay? Hot potato algorithm Flooding Dijkstra algorithm Random walk algorithm Optimal routing Reveal answer Fill a bubble to check yourself B Correct answer Explanation It always chooses the shortest path because it chooses every possible path in parallel.