http://franz.com/ns/allegrograph/4.11/sna/bidirectionalSearchPaths

Compute Bidirectional Search paths.

This magic property can be used in two ways: 

(?start ?path) sna:bidirectionalSearchPaths ( ex:namedGenerator ?end )

 (?start ?path) sna:bidirectionalSearchPaths ( ex:namedGenerator ?end ?depth )

It produces bindings to ?path for each path between ?start and ?end (which must be bound) using the generator ex:namedGenerator and the optional ?depth to limit the search.

The bindings to ?path act like blank nodes in that they have no meaning outside of query execution. During the execution, however, they can be used in other magic properties to return the length of the path or the nodes along it.

Notes

The following namespace abbreviations are used:

The SPARQL magic properties reference has additional information on using AllegroGraph magic properties and functions.