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

# P82 (*) Cycle from a given node
# 
# Write a predicate cycle(G,A,P) to find a closed path (cycle) P starting at a
# given node A in the graph G. The predicate should return all cycles via
# backtracking.

if 1 {
    skip 1, "Test(s) not yet written: (*) Cycle from a given node";
}
else {
    ok 1, '(*) Cycle from a given node';
}
