Exhaustive search. Just try out every vertice recursively and disregard any vertices that you already have in your path. If you want all paths and not only the shortest or anything I don't see much possibility for a shortcut

You can speed this up a bit if you change the recursive function to an interative, but basically you just simulate the recursion then.

UPDATE: See Limpic-Regions post for the truth about shortcuts