Matej, in this case, Iterator<Path> paths = Traversal.description().relationship(TICKET_STATUS,INCOMING).relationship(TICKET_STATUS_EVENT,INCOMING).traverse(db.getNodeById(1001)).iterator();
should give you an iterator of Paths, where you can just get the end node by doing paths.next().endNode() Would that help? 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 Sat, Mar 26, 2011 at 7:55 PM, Matěj Plch <plchm...@fit.cvut.cz> wrote: > Well maybe the best one to show the graph: > https://webdev.fit.cvut.cz/~plchmate/mi-w20/neoclipse.png > <https://webdev.fit.cvut.cz/%7Eplchmate/mi-w20/neoclipse.png> > There is a ticket node:1001 and I would like to get all nodes under for > example node Status_Events. Now there is only one node, in real there > will be more nodes. But not so much (not more than 100 Im quite sure). > > Dne 26.3.2011 19:35, Michael Hunger napsal(a): >> Sure, if the tree from your root node is just a cluster that is not >> connected anywhere else (with those 3 relationship-types) it should be as >> simple as. >> (Just written from my head, so please check the correct syntax). >> >> Traversal.description().relationship(T1,OUTGOING).relationship(T2,OUTGOING).relationship(T3,OUTGOING).traverse(rootNode); >> >> That returns an iterator of all paths going from your root node. >> >> You can limit the nodes with .uniqueness() and then add the path's >> (path.nodes()) to a set to collect all nodes. >> >> For getting the one with the highest id, you can use >> java.util.Collections.max(collection, new Comparator<Node>(){}); >> >> How big is your tree? >> >> Something like that should be in Graph-Algo perhaps as "subgraph" or "tree". >> >> HTH >> >> Michael >> >> Am 26.03.2011 um 19:26 schrieb Matěj Plch: >> >>> Thank you for so fast answer. >>> I will look at it. I have milestone tomorrow so dont have a lot of >>> time=) and have never worked with Groovy. >>> Well so there isnt any simple method how to do it in classic neo4j Java API? >>> >>> Dne 26.3.2011 19:16, Saikat Kanjilal napsal(a): >>>> You can do all of these things using gremlin and pipes. Check out github >>>> for more details. >>>> >>>> Sent from my iPhone >>>> >>>> On Mar 26, 2011, at 11:13 AM, Matěj Plch<plchm...@fit.cvut.cz> wrote: >>>> >>>>> Hi, I have some graph and, part of it is a tree. I simple get root of >>>>> this tree through id. How to simple tranverse only tree under this root >>>>> node? From root goes three unique type relationship to three unique >>>>> group type nodes. Under this three nodes are a lot of nodes. And I need >>>>> to write a method which gives me all nodes under that group node. >>>>> Second question is if its possible ho to get from this group noe with >>>>> the highest id (last added). >>>>> Matěj Plch >>>>> >>>>> _______________________________________________ >>>>> Neo4j mailing list >>>>> User@lists.neo4j.org >>>>> https://lists.neo4j.org/mailman/listinfo/user >>>>> >>>> _______________________________________________ >>>> Neo4j mailing list >>>> User@lists.neo4j.org >>>> https://lists.neo4j.org/mailman/listinfo/user >>> _______________________________________________ >>> Neo4j mailing list >>> User@lists.neo4j.org >>> https://lists.neo4j.org/mailman/listinfo/user >> _______________________________________________ >> Neo4j mailing list >> User@lists.neo4j.org >> https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
