[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
# possible_path(+SourceNode, +SinkNode, +Tolerance, +Lengths, +Predecessors, -Path)

Computes an actual path from a predecessors array
*SourceNode*
- source node number
*SinkNode*
- sink node number
*Tolerance*
- tolerable deviation from minimal length (non-negative number)
*Lengths*
- array of numbers
*Predecessors*
- array of edge lists
*Path*
- Length-EdgeList structure

## Description

This predicate is deprecated, it is equivalent to possible_path/7 with
a DistanceArg of 0.

### Modes and Determinism

- possible_path(+, +, +, +, +, -) is nondet

## See Also

possible_path / 7