How can I efficiently find all edges in an undirected graph that are part of a simple path between given vertices A and B?
How can one determine every possible route which covers all vertices between two given points in an undirected graph?