I have a tree. This tree has no particular root (free-tree). I want to find a path that visit all nodes. This path has to be the shortest possible.
All edges are considered to have a distance of 1.
My problem is not finding a Hamiltonian path, because I don't have any restriction on the number of times a node can be visited.
We don't know the source node of the path. The source has to be one allowing us to find the shortest path visiting all nodes.