There is no defined longest path, since the graph has a ton of loops.

Finding the longest shortest path (that is finding the minimum number of nodes from each wikipedia entry to the entry for Hitler) and then finding the longest is, however, rather easy.