Neo4j

I have a graph database representing a subway system. I am interested in finding all simple paths (paths that do not visit the same station twice) possible from one station to another. Due to the complexity of the train network, there may be thousa...

I have been looking at graph databases as a means of solving some pathfinding problems. Until recently I have been able to solve these problems in small implementations like NetworkX. As the scale of the problem is growing, I need a more powerful so...