BFS graph solver
This tool takes an xml constructed graph and finds all possible paths between home nodes for a set amount of travellers. A "home node" is defined as a starting point for each traveller. The search is performed using Breadth-first search algorithm and depending on the parameters (size of graph, number of home nodes and travellers) it may take quite a while to find all possible solutions (by default a limit on number of solutions is set which you can disable using --limit 0).
The algorithm passes through each node only once, so cycles are not taken into account. You can use a flag to switch to "cyclic-BFS" variant which disable this constraint.
For detailed usage information run solver.py with no cmd line parameters. start.bat launches the GUI, which requires wxPython installed on your computer.
Usage (cmd line)
python solver.py -filename=graph.xml