1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
#!/usr/bin/perl -w
# Copyright 2019 Kevin Ryde
# This file is part of Math-PlanePath.
#
# Math-PlanePath is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by the Free
# Software Foundation; either version 3, or (at your option) any later
# version.
#
# Math-PlanePath is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with Math-PlanePath. If not, see <http://www.gnu.org/licenses/>.
use 5.010;
use strict;
use warnings;
use File::Slurp;
use FindBin;
use Graph;
use List::Util 'min', 'max';
use Test;
plan tests => 4;
use lib 't','xt';
use MyTestHelpers;
BEGIN { MyTestHelpers::nowarnings(); }
use MyOEIS;
use Math::PlanePath::CCurve;
use File::Spec;
use lib File::Spec->catdir('devel','lib');
use MyGraphs;
#------------------------------------------------------------------------------
sub make_graph {
my ($level) = @_;
my $path = Math::PlanePath::CCurve->new;
my $graph = Graph->new (undirected => 1);
my ($n_lo, $n_hi) = $path->level_to_n_range($level);
foreach my $n ($n_lo .. $n_hi) {
my ($x,$y) = $path->n_to_xy($n);
$graph->add_vertex("$x,$y");
}
foreach my $n ($n_lo .. $n_hi-1) {
my ($x,$y) = $path->n_to_xy($n);
my ($x2,$y2) = $path->n_to_xy($n+1);
$graph->add_edge("$x,$y", "$x2,$y2");
}
return $graph;
}
{
my %shown;
{
my $content = File::Slurp::read_file
(File::Spec->catfile($FindBin::Bin,
File::Spec->updir,
'lib','Math','PlanePath','CCurve.pm'));
$content =~ /=head1 HOUSE OF GRAPHS.*?=head1/s or die;
$content = $&;
my $count = 0;
while ($content =~ /^ +(?<id>\d+) +level=(?<level>\d+)/mg) {
$count++;
my $id = $+{'id'};
my $level = $+{'level'};
$shown{"level=$level"} = $+{'id'};
}
ok ($count, 9, 'HOG ID number of lines');
}
ok (scalar(keys %shown), 9);
### %shown
my $extras = 0;
my $compared = 0;
my $others = 0;
my %seen;
# 3^6 == 729
foreach my $level (0 .. 10) {
my $graph = make_graph($level);
last if $graph->vertices >= 256;
my $g6_str = MyGraphs::Graph_to_graph6_str($graph);
$g6_str = MyGraphs::graph6_str_to_canonical($g6_str);
next if $seen{$g6_str}++;
my $key = "level=$level";
if (my $id = $shown{$key}) {
MyGraphs::hog_compare($id, $g6_str);
$compared++;
} else {
$others++;
if (MyGraphs::hog_grep($g6_str)) {
MyTestHelpers::diag ("HOG $key in HOG, not shown in POD");
my $name = $graph->get_graph_attribute('name');
MyTestHelpers::diag ($name);
MyTestHelpers::diag ($g6_str);
# MyGraphs::Graph_view($graph);
$extras++;
}
}
}
ok ($extras, 0);
ok ($others, 0);
MyTestHelpers::diag ("POD HOG $compared compares, $others others");
}
#------------------------------------------------------------------------------
exit 0;
|
