A Hamiltonian route is a path in an undirected or directed graph that visits each vertex precisely once. The correct option is D.
What is Hamilton Path?
A Hamiltonian route is a path in an undirected or directed graph that visits each vertex precisely once, according to graph theory.
To know the shortest path, let's find the length of each path by comparing it,
A.) A to B to C to D to E
Length = 4 + 3 + 4 + 2 =13
B.) A to B to E to D to C to B
Length = 4+3+2+4+3 = 16
C.) A to D to C to B to E
Length = 3+4+3+3 = 13
D.) C to B to A to D to E
Length = 3+4+3+2 = 12
Hence, the correct option is D.
Learn more about Hamilton Path:
https://brainly.com/question/15139147
#SPJ2
