What is the shortest Hamilton path for the vertex-edge graph?
A
B C
D.
E
O E to D to A to B to C
OC to E to D to A to B
OA to D to E to B to C
OD to A to E to B to C