Shortest Path Visiting All Nodes

Given an undirected connected graph, print the length of the shortest path that visits every node. You may start and end at any node and revisit nodes and edges.

1 <= n <= 12