user
Given the following problem, find the shortest path and output the nodes.

Now complete the following instance -
Input: Find the shortest path between node A and node E in the given graph.

A--B--C--D--E
Output:
assistant
A, B, C, D, E