java - Dijkstra variation in Neo4j - find all paths -

i using neo4j understand popularity of holiday destinations, in terms of has visited , next interested in based on people similar travel schemes them.

i have neo4 database, have nodes, representing location , relationships representing have come gone to.

for example, have 1 "venice" -> "rome" count 300.

now want understand paths created, predict path of lets 10 locations, people go to: "venice" -> "rome" -> "vienna" -> "barcelona" -> "madrid" -> ...

aims of project:

• i want understand paths between 2 nodes (all pairs of nodes)
• restrict paths maximum of length 10, should paths if found, length 4 etc.
• use dijiktra's - version focuses on choosing maximum count - should invert count?

i have been looking iteration through nodes, , finding paths node. involve nested loop , variation on dijkstra .

there has been discussion on how nodes here

my questions are:

• whether approach suitable?
• how create own path finding algorithm - or vary existing algorithms? - dijkstra
• is there more efficient way of this, rather iteration through nodes?

i put @ http://gist.neo4j.org/?9363884, shows how hold meta information paths in nodes, , denote differente paths relationship types. not paths query want do, might give modeling hints.

for all-paths, write own algo in java , use either server plugin or directly java code, see http://docs.neo4j.org/chunked/stable/server-plugins.html