graph
objectgraph
, Alias: g
graph.addDefaultNamespaces()
graph.addNamespace(pref, ns)
graph.emit(*)
graph.loadNamespaces()
graph.M()
graph.Morphism()
graph.IRI(s)
graph.V(*)
graph.Vertex([nodeId],[nodeId]...)
nodeId
(Optional): A string or list of strings representing the starting vertices..Morphism()
and .Vertex()
create path objects, which provide the following traversal methods. Note that .Vertex()
returns a query object, which is a subclass of path object.<follows>
relationship, and the nodes with an extra #
in the name have an extra <status>
link. As in,*
s in the name -- these are our smart people, according to the <smart_graph>
label, eg, the quad:path.all()
path.and(path)
path.as(tags)
path.back([tag])
tag
: A previous tag in the query to jump back to.path.both([predicatePath], [tags])
path.count()
path.difference(path)
path.except(path)
g.V().except(path)
to achieve U - B = !B
is supported, it's often very slow. Example:path.filter(args)
path.filter(regex(expression, includeIRIs))
true
.path.follow(path)
path.followR(path)
path.followRecursive(*)
path.forEach(callback) or (limit, callback)
limit
(Optional): An integer value on the first limit
paths to process.callback
: A javascript function of the form function(data)
path.getLimit(limit)
path.has(predicate, object)
predicate
: A string for a predicate node.object
: A string for a object node or a set of filters to find it.path.hasR(*)
path.in([predicatePath], [tags])
path
on the object, follow the quads with predicates defined by predicatePath
to their subjects.predicatePath
(Optional): One of:tags
(Optional): One of:path.inPredicates()
path.intersect(path)
path.is(node, [node..])
node
: A string for a node. Can be repeated or a list of strings.path.labelContext([labelPath], [tags])
predicatePath
(Optional): One of:tags
(Optional): One of:path.labels()
path.limit(limit)
limit
: A number of nodes to limit results to.path.map(*)
path.or(path)
path.out([predicatePath], [tags])
path
on the subject, follow the quads with predicates defined by predicatePath
to their objects.predicatePath
(Optional): One of:tags
(Optional): One of:path.outPredicates()
path.save(predicate, tag)
predicate
: A string for a predicate node.tag
: A string for a tag key to store the object node.path.saveInPredicates(tag)
path.saveOpt(*)
path.saveOptR(*)
path.saveOutPredicates(tag)
path.saveR(*)
path.skip(offset)
offset
: A number of nodes to skip.path.tag(tags)
tag
: A string or list of strings to act as a result key. The value for tag was the vertex the path was on at the time it reached "Tag"path.tagArray(*)
path.tagValue()
path.toArray(*)
path.toValue()
path.union(path)
path.Tag()
path.unique()
path.order()