I think you are right. Paths are unique but nodes in that path are not. But I need only unique path with unique nodes so that path is not repeated again. Any ideas on how to achieve that?
On Fri, Jul 29, 2011 at 1:25 PM, Mattias Persson <[email protected]>wrote: > It returns unique paths considering both nodes and relationships, so maybe > you're only looking at the nodes in the paths and sees that the paths > aren't > unique in that aspect? > > 2011/7/29 Manav Goel <[email protected]> > > > Hi > > I was testing GraphAlgoFactory functions. I am getting duplicate > > results from this function. > > I have 2 user nodes A and B and they follow something I1 and I2. > > > > A-->I1, A-->I2 > > B-->I1 , B-->I2 > > > > Now I want to find shortest paths between A and B using relationship > > type between user and interest.When I execute the function it returns > > A-->I1<--B many times which unnecessarily forces me to process > duplicate > > entries. > > How to solve this problem? > > > > Regards, > > > > > > > > -- > > Manav Goel > > _______________________________________________ > > Neo4j mailing list > > [email protected] > > https://lists.neo4j.org/mailman/listinfo/user > > > > > > -- > Mattias Persson, [[email protected]] > Hacker, Neo Technology > www.neotechnology.com > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > -- Manav Goel Associate Software Engineer Relay Strategy Chandigarh India _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
