A few colleagues decided to carpool on the way to work. The following map displays the routes between their homes.
Starting from house $A$A, what is the shortest path that visits every house exactly once?
Represent the path by listing the vertices in order, separated by commas.
Choose appropriate networks to find optimal solutions
Apply network methods in solving problems