The naive approach (start at first and successively take the shortest edge to a yet unvisited node) gives a path of length 95166.

Thats not bad considering that the lower bound for any possible solution is already at 70135! (summing up all minimal edges per node and striking the longest of those edges again)

NB: This doesn't mean that such a solution exists, thats fairly utopic.