Vocabularies

Path search

PREFIX path: <http://w3id.org/tripletrail/path#>

Unweighted path search over any predicates, in SERVICE <http://w3id.org/tripletrail/path>: the parameters say where paths start and end and which edges they follow; the results bind each path and its steps.

Turtle: path.ttl. Reference: Routing.

TermKindDescription
path:sourceParameterWhere paths start and end: IRIs or literals, given once or more (or as a list). Without a target every node reached is an end; without a source the search runs backwards from the targets.
path:targetParameterWhere paths start and end: IRIs or literals, given once or more (or as a list). Without a target every node reached is an end; without a source the search runs backwards from the targets.
path:predicateParameterThe edges: predicates followed from subject to object (once or more, or a list). Or, instead, a sub-select whose first two variables are an edge's ends and an optional third its label. With neither, every triple from an IRI to an IRI, read from the indexes as the search reaches each node.
path:exceptPredicateParameterWithout path:predicate or a sub-select: predicates left out (once or more, or a list), such as rdf:type.
path:directionParameter"out" (default), "in" (object to subject) or "both".
path:graphParameterSearch one named graph's edges instead of the default graph's.
path:modeParameter"shortest" (default): one shortest path from each start to each end it reaches, the first found breadth first. "simple": every path that visits no node twice. "all": every walk, nodes repeated, which needs path:maxLength.
path:minLengthParameterIn edges; 0 and unlimited by default.
path:maxLengthParameterIn edges; 0 and unlimited by default.
path:maxPathsParameterAt most this many paths from each start to each end (simple and all).
path:pathResult
path:startResult
path:endResult
path:lengthResult
path:stepResult
path:fromResult
path:edgeResult
path:toResult