Heinz, do you know ANYTHING of that path? Or do you simply want to know if there is any path between all nodes, a bit like routing? In that case, I think you need to have some form of PathExists between 2 nodes, and then have an algorithm that repeats this until you have a path between all node pairs. Dunno if there is some existing work on this.
Do you care to describe your use case? Cheers, /peter neubauer GTalk: neubauer.peter Skype peter.neubauer Phone +46 704 106975 LinkedIn http://www.linkedin.com/in/neubauer Twitter http://twitter.com/peterneubauer http://www.neo4j.org - Your high performance graph database. http://startupbootcamp.org/ - Öresund - Innovation happens HERE. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Tue, Aug 30, 2011 at 10:39 AM, deker <[email protected]>wrote: > hi > i think not really. > > i know some node ids. i got this ids by a index search. > now i want to look if this nodes are on a path. > > thx > > -- > View this message in context: > http://neo4j-community-discussions.438527.n3.nabble.com/How-to-check-if-nodes-more-than-2-are-connect-with-relationship-tp3294832p3294935.html > Sent from the Neo4j Community Discussions mailing list archive at > Nabble.com. > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
