I want to update the ending node for all relationships that are type :foo
coming into node A to node B.
For example, for all relationships that are type :foo coming into node A
(node A as the end node), no matter where their starting node is, I want
them to set the end node to node B.
Node C
Hi,
I did you example over TinkerGraph as vertex IDs are Strings and thus, easy to
build your graph with.
~$ gremlin
\,,,/
(o o)
-oOOo-(_)-oOOo-
gremlin g = new TinkerGraph()
==tinkergraph[vertices:0 edges:0]
gremlin g.addVertex('A'); g.addVertex('B');
Hey,
One more thing.
WARNING: If your transaction mode is AUTOMATIC, then there will be one
transaction for each mutation !! tx.begin/tx.commit/tx.finish
gremlin g.transactionMode
==AUTOMATIC
You can use a transaction manager if you plan this query to iterate over lots
of vertices and do
Thanks!
On Wed, Aug 31, 2011 at 6:50 PM, Marko Rodriguez okramma...@gmail.comwrote:
Hey,
One more thing.
WARNING: If your transaction mode is AUTOMATIC, then there will be one
transaction for each mutation !! tx.begin/tx.commit/tx.finish
gremlin g.transactionMode
==AUTOMATIC
You can
4 matches
Mail list logo