Conditional Traversals With Gremlin by Max Lincoln.
An eligibility test that depends upon the ability to traverse to a particular node in the graph.
Reminded me of my musings on transient properties/edges.
Is not choosing an edge is the same thing as the edge not being present? For all cases?
Max mentions that NoSQL Distilled says this use case isn’t the typical one for graphs.
My suggestion is to experiment and rely on your own requirements and experiences.
Authors have to paint with a very broad brush or their books would all look like the Oxford English Dictionary (OED). Fascinating but not for the faint of heart.
BTW, when looking up the reference for the Oxford English Dictionary, the wikipedia reference mentioned that:
The Dutch dictionary Woordenboek der Nederlandsche Taal, which has similar aims to the OED, is the largest and it took twice as long to complete.
I don’t read Dutch but the dictionary is reported to be available for free at: http://gtb.inl.nl/
If you read Dutch, please confirm/deny the report. I would like to send a little note along the the OED crowd about access as a public service. (Like they would care what I think. Still, doesn’t hurt to comment every now and again.)