Sure, I sent you a link where you can download a snapshot of the dataset in a separate email.
Best regards, Petar On Mon, Nov 28, 2011 at 12:16 PM, Mattias Persson <matt...@neotechnology.com > wrote: > I think I'd need your dataset to be able to reproduce and fix it, would > that be possible? > > 2011/11/25 Petar Dobrev <petar.dob...@myphilanthropedia.org> > > > On Fri, Nov 25, 2011 at 7:59 PM, Mattias Persson > > <matt...@neotechnology.com>wrote: > > > > > > > > Correct, it finds paths on that depth only. If other paths are > > encountered > > > along the way they aren't returned. > > > > > > > > > > However, in the example I provided it misses a path that is present on > the > > desired depth, that's what I was actually wondering about. > > > > In this example: > > > > The source of the testing program is here: > https://gist.github.com/1391654 > > Output before adding the additional relationship: > > https://gist.github.com/1391668 > > Output after adding the additional relationship: > > https://gist.github.com/1391661 > > > > shortestPath misses one path (at depth 3) unless an additional > relationship > > is present, which is unrelated to the paths between the nodes. > > > > Petar > > _______________________________________________ > > Neo4j mailing list > > User@lists.neo4j.org > > https://lists.neo4j.org/mailman/listinfo/user > > > > > > -- > Mattias Persson, [matt...@neotechnology.com] > Hacker, Neo Technology > www.neotechnology.com > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > -- Petar Dobrev Engineer Philanthropedia http://www.myphilanthropedia.org _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
