Marko Rodriguez schrieb am 30.03.2010 um 12:50:21 (-0600): > > XPath easily generalizes to work for graphs. See > http://gremlin.tinkerpop.com and more specifically, > http://wiki.github.com/tinkerpop/gremlin/basic-graph-traversals
Some more questions on Gremlin :-) Quoting from the page on basic graph traversal: It is important to note that in Gremlin, vertices are adjacent to edges and edges are adjacent to vertices. Well - isn't that in the nature of the graph? As far as my understanding goes, there is no such thing as vertex on vertex, or edge to edge. It's always an edge between two vertices, and alway a vertex between two edges. Navigating the graph means alternately traversing vertices and edges. Unless I'm mistaken, that is. The reserved terms for denoting adjacency selection are outE, inE, bothE, outV, inV, and bothV I understand outE, inE and bothE. Edges may have a direction (or two, or none - depending on the point of view), so in/out/both looks like the logical thing to do. But what about outV and inV? Vertices aren't directional, are they? -- Michael Ludwig _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
