Hi, I have created a directed acyclic graph using py2neo. Part of it looks like, a->b b->c b->d c->d Here '->' represents 'knows'
I have two questions. 1. How can I find the node which knows both 'c' and 'd' and closest to them? Something like lowest common ancestor in tree. 2. How to find the shortest distance between 'a' and 'b'? Please let me know if any tutorial is available to solve these two questions. Thanks -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
