And in the java API you can also iterate over the GraphDatabaseService.getAllNodes result. Could be expensive though.
On Wed, Mar 17, 2010 at 5:14 PM, Lorenzo Livi <[email protected]> wrote: > Hi, > > foreach KEY in the lucene index > retrieve the node n > if(degree(n)==0) > found! > > should work ... > > Lorenzo > > > On Wed, Mar 17, 2010 at 5:05 PM, Greg Stich <[email protected]> > wrote: > > Hello, > > > > I'm interested in using neo4j for a content management project. I'd > > like to track relationships between content assets (nodes) in order to > > search for depending elements. > > Furthermore, I'd like to get a set of isolated nodes (incoming = > > outgoing relations = 0) for which one can assume that they are > > obsolete. > > > > While I can imagine to use the "traverse" method to find depending > > elements ("transitive closure"), I'm not sure of how to spot isolated > > nodes. > > > > What would you suggest for this use case? > > > > Is there a suitable class or method in > http://wiki.neo4j.org/content/Graph-algo? > > > > Kind regards > > Greg > _______________________________________________ > Neo mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
