What is the shortest Hamilton path for the vertex-edge graph?




D to A to E to B to C

A to D to E to B to C

E to D to A to B to C

C to E to D to A to B