Hi, I'm looking for a good way to detect a cyclic graph. I'd hoped there was an traverser that could traverse a graph and exit with a special condition if it returned to the start node, but it seems all traversers ignore nodes already encountered, so that does not help. Any ideas?
Right now we're looking to simply code our own search. Not as nice as using the API, and probably not as fast. Cheers, Craig _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
