Hi all,
Hope this is correct place to ask. I tried on Stackoverflow without any
luck.
In a simple view, my scenario looks like this:
- Triangle topology (A connected to B, A connected to C, C connected to
B)
- edge between A and B has cost 4000
- edge between A and C has cost 2000,
- edge between C and B has cost 2000
- Custom evaluator
- Custom expander
- Executing neo4j using the Java API
- Call to Dikjstra Algo findAllPaths(A, B)
I would expect two paths to be returned
1. A,B
2. A,C,B
Unfortunately this does not work.
In my debugging, it shows that neo4j returns A,B first connected. Then on
the next path request iteration, it discards path A,C,B because it says B
is already visited (even though it's our destination!)
For even more detailed input + screenshot of code in question, please
see
http://stackoverflow.com/questions/30659084/neo4j-findallpaths-not-working-only-returning-one-path
I really greatly appreciate any input anyone may have
Thank you
Andrew
--
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.
