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

# P89 (**) Bipartite graphs
# 
# Write a predicate that finds out whether a given graph is bipartite.
# 
# Miscellaneous Problems

if 1 {
    skip 1, "Test(s) not yet written: (**) Bipartite graphs";
}
else {
    ok 1, '(**) Bipartite graphs';
}
