Computation |
The paths are computed based on all
loaded relations in the graph. |
The paths are computed from the index
between the start and stop objects. |
Start and stop order |
The paths are computed in both
directions. Therefore the order of the start and stop
objects is not relevant. |
If you select a leaf as start and a
root as stop, no paths are found. |
View |
Only the tile is displayed. |
A tree branch is also displayed under
the tile view, so you can see the detail of all objects
individually. |
Drag and drop behavior |
With drag and drop, this path behaves
as a if selecting all objects in the path. |
If you drag this path, it behaves as a
structure path. Depending on the target app, either the whole path is taken into account, or only
the leaf (stop). You can also select an Advanced filter
as a start. In this case, the computed paths match the
filter specification. |