Is there any way to find more paths between two specific nodes than just the shortest one? Eg., the second shortest. Or do I need to modify the shortest path to be not shortest and query again? :)
OQ is new for me but I think "The magic" query lakes with paths, also I'm loss: why using weight field when calculating the depth? I thing "weight" must always be a weight property, and depth must appear as an additional field when calculating path (latch=1), to identify path an additional field 'pathid' would be nice, so the 'seq' will be different for each path group.
Also I want to point authors forward to neo4j database, please look to the traversing principals that lays under the hood of this neo4j db, I didn't mean that it is an ideal solution (there is no RDBM's features at all) but there are delicious features to think about.
OQ is new for me but I think
OQ is new for me but I think "The magic" query lakes with paths, also I'm loss: why using weight field when calculating the depth? I thing "weight" must always be a weight property, and depth must appear as an additional field when calculating path (latch=1), to identify path an additional field 'pathid' would be nice, so the 'seq' will be different for each path group.
Also I want to point authors forward to neo4j database, please look to the traversing principals that lays under the hood of this neo4j db, I didn't mean that it is an ideal solution (there is no RDBM's features at all) but there are delicious features to think about.