Non oriented Path

Search non oriented path between two resources with given maximal length.

?x c:relation{n} ?y search the $2^{n+1} - 2$ paths of length $\leq n$ between ?x and ?y

?x c:relation{2} ?y

Generates :

?x  c:relation ?y
?y  c:relation ?x

?x  c:relation ?v  ?v c:relation ?y
?x  c:relation ?v  ?y c:relation ?v
?v  c:relation ?x  ?y c:relation ?v
?v  c:relation ?x  ?v c:relation ?y

This statement should be used with care, typically with well identified ?x and ?y and $n < 5$.

The processor stops after one successful path. It is possible to test all paths using the all qualifier.