There are two ways to do it: the first is to consider the "longest shortest path", as makmanalp said, and find the longest path among the set of shortest paths

There are two ways to do it: the first is to consider the "longest shortest path", as makmanalp said, and find the longest path among the set of shortest paths from an article to Hitler. The second is to not travel to any node twice in a given path.