@@ -13,7 +13,7 @@ my $g1 =
1313 %('from'=>'4','to'=>'6','weight'=>1), %('from'=>'4','to'=>'7','weight'=>1), %('from'=>'4','to'=>'8','weight'=>1),
1414 %('from'=>'5','to'=>'6','weight'=>1), %('from'=>'5','to'=>'7','weight'=>1), %('from'=>'5','to'=>'8','weight'=>1)
1515 ]):directed;
16- say $g1.wl(VertexLabels => "Name");
16+ # say $g1.wl(VertexLabels => "Name");
1717
1818my $g2 =
1919 Graph.new([
@@ -45,28 +45,28 @@ my $g4 =
4545subtest {
4646 ok Graph::Relation.new( {$^a < 6 && $^b > 6}, (1...8));
4747 my $g = Graph::Relation.new({$^a < 6 && $^b ≥ 6}, (1...8));
48- say $g.wl(VertexLabels => "Name");
48+ # say $g.wl(VertexLabels => "Name");
4949 is $g.eqv($g1), True;
5050}, "Simple bipartite graph";
5151
5252## 2
5353subtest {
5454 my $g =Graph::Relation.new( {$^a gcd $^b == 1}, (1...7));
55- say $g.wl(VertexLabels => "Name");
55+ # say $g.wl(VertexLabels => "Name");
5656 is $g.eqv($g2), True;
5757}, "Coprime";
5858
5959## 3
6060subtest {
6161 my $g =Graph::Relation.new( {!$^a.contains($^b)}, <a ab abc abcd>);
62- say $g.wl(VertexLabels => "Name");
62+ # say $g.wl(VertexLabels => "Name");
6363 is $g.eqv($g3), True;
6464}, "String free";
6565
6666## 4
6767subtest {
6868 my $g = Graph::Relation.new({$^a < 6 && $^b ≥ 6}, (1...5), (6...8));
69- say $g.wl(VertexLabels => "Name");
69+ # say $g.wl(VertexLabels => "Name");
7070 is $g.eqv($g4), True, 'expected graph';
7171 is $g.is-bipartite, True, 'is bipartite';
7272}, "Bipartite for two arrays";
0 commit comments