graph

graph copied to clipboard

A new `call` step was added as part of TinkerPop 3.6.x

krlawrence

Significant improvements to the "create if not exist" pattern were introduced in TinkerPop 3.6.0, with refinements in subsequent releases, via the new `mergeV` and `mergeE` steps. Quite a bit of...

krlawrence

Anonymous traversals are only mentioned five times in the fist edition and in at least one case not described quite accurately. They are described as not spawning from V or...

krlawrence

Most of the Common Serialization Format section is marked with "To be written" reminders. Decide what the direction is for this section.

spmallette

Add an example such as ``` gremlin> g.V().has('code','YPO').outE().inV().outE().inV().simplePath().path().by(constant(0)).by('dist') ==>[0,188,0,55,0] gremlin> g.V().has('code','YPO').outE().inV().outE().inV().simplePath().path().by(constant(0)).by('dist').sum(local) ==>243 ```

krlawrence

I noticed that some distances in the first 46 airport graph (a.k.a. the small graph) are wrong. This also impacts the full graph. Need to regenerate the routes using `MakeRouteGraph`...

krlawrence

In the book, many examples feature the `sack` step to produce a total distance. In some cases, if all you want is the total, the `path` step is enough. A...

krlawrence

Cases like this can be confusing to Gremlin users ``` gremlin> g.V(3).out().out().count() ==>7858 gremlin> g.V(3).out().out().dedup().count() ==>992 gremlin> g.V(4).out().out().count() ==>6817 gremlin> g.V(4).out().out().dedup().count() ==>812 gremlin> g.V(3,4).as('a').out().out().group().by(select('a').id()).by(count()) ==>[3:7858,4:6817] gremlin> g.V(3,4).as('a').out().out().dedup().group().by(select('a').id()).by(count()) ==>[3:992] ``` Once...

krlawrence

Dear @krlawrence and @spmallette , Thank you for dedicating your time to write the book on Graph Databases. It is a lighthouse that guides seafarers in the graph world especially...

Arap-Odawa