I was just wondering if there is any way to alter the path finding algorithms? I would like to use a variation of Dijkstra algorithm whereby paths chosen have a higher count. I have posted my full question on stackoverflow<http://stackoverflow.com/questions/22304329/dijkstra-variation-in-neo4j-find-all-paths>, any help would be appreciated!
Thanks Ruby -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
