Given a multi-undirected graph, how can I find the number of different paths from Node A to B using every node in the graph (means shortest path algorithms are useless)
In some cases there may be no way to achieve this. I am looking for the number of available different paths.
Note: You have to use every node and use them once.