Hi Marko, Marko Rodriguez schrieb am 30.03.2010 um 12:50:21 (-0600): > > Also, XPath being for trees, do you constrain the graph to tree > > form? > > XPath easily generalizes to work for graphs. See > http://gremlin.tinkerpop.com and more specifically, > http://wiki.github.com/tinkerpop/gremlin/basic-graph-traversals ... > However, the // recursion operator can get out of control.
That's very interesting! What about cycles? A --knows--> B --knows--> C --knows--> A # or A --knows--> B --knows--> C --knows--> B Will the traverser follow these? Or does it maintain a map of seen edges and/or vertices so it will avoid cycles? Also, this raises the question of traversal order: Let's assume that A --knows--> B, C and D. Is there an order specified for going along the edges, such as *document order* in XSLT? Or are edges specified to be unordered, such as attributes in XDM (XPath Data Model)? -- Michael Ludwig _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
