-In Figure 2b, using backtracking step of the shortest route algorithm, the shortest route from node 1 to node 6 is
A) $1-2-4-6$
B) $1-3-2-4-6$
C) $1-3-5-6$
D) $1-2-3-6$

Question

-In Figure 2b, using backtracking step of the shortest route algorithm, the shortest route from node 1 to node 6 is 
A) $1-2-4-6$ 
B) $1-3-2-4-6$ 
C) $1-3-5-6$ 
D) $1-2-3-6$

Quizplus · Accepted Answer

The Answer of 
-In Figure 2b, using backtracking step of the shortest route algorithm, the shortest route from node 1 to node 6 is 
A) $1-2-4-6$ 
B) $1-3-2-4-6$ 
C) $1-3-5-6$ 
D) $1-2-3-6$

-In Figure 2b, Using Backtracking Step of the Shortest Route 1−2−4−61-2-4-61−2−4−6

-In Figure 2b, Using Backtracking Step of the Shortest Route $1-2-4-6$