use v6-alpha;
use Test;
use v6;
use Test;
plan 1;

# P81 (**) Path from one node to another one
# 
# Write a predicate path(G,A,B,P) to find an acyclic path P from node A to node
# b in the graph G. The predicate should return all paths via backtracking.

if 1 {
    skip 1, "Test(s) not yet written: (**) Path from one node to another one";
}
else {
    ok 1, '(**) Path from one node to another one';
}
