An ant is walking on the edges of an icosahedron with a side length of $1$. Compute the length of the longest path that the ant can take if it never travels over the same edge twice, but is allowed to revisit vertices.

Let's think step by step and output the final answer within \boxed{}.
user