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

# P87 (**) Depth-first order graph traversal (alternative solution)
# 
# Write a predicate that generates a depth-first order graph traversal sequence.
# The starting point should be specified, and the output should be a list of
# nodes that are reachable from this starting point (in depth-first order).

if 1 {
    skip 1, "Test(s) not yet written: (**) Depth-first order graph traversal (alternative solution)";
}
else {
    ok 1, '(**) Depth-first order graph traversal (alternative solution)';
}
