- my ($x,$y, $arch,$island,$solid,$dirn);
- my $nn= sub { return nn_xy($x,$y) };
-
- if (($x,$y,$arch) =
- m/^\{\{ chart\ label \|(\d+)\|(\d+)\| .*
- \'\[\[ [^][\']* \| (\S+)\ archipelago \]\]\'*\}\}$/xi) {
- printf PO "%d,%d arch %s\n", $x,$y,$arch;
- push @arch_labels, [ $x,$y,$arch ];
- } elsif (($x,$y,$island) =
- m/^\{\{ chart\ island\ icon \|(\d+)\|(\d+)\|
- (\S.*\S) \| .*\}\}$/xi) {
- $islandname{$nn->()}= $island;
- $dists->add_vertex($nn->());
- $archs->add_vertex($nn->());
- printf PO "%d,%d island %s\n", $x,$y,$island;
- } elsif (($solid,$x,$y,$dirn) =
- m/^\{\{ chart\ league((?:\ solid)?) \|(\d+)\|(\d+)\|
- ([-\/\\o]) \| .*\}\}$/xi) {
- next if $dirn eq 'o';
-
- my ($bx,$by) = ($x,$y);
- if ($dirn eq '-') { $bx+=2; }
- elsif ($dirn eq '\\') { $bx++; $by++; }
- elsif ($dirn eq '/') { $bx--; $by++; }
- else { die; }
-
- $dists->add_edge($nn->(), nn_xy($bx,$by));
- $archs->add_edge($nn->(), nn_xy($bx,$by)) if $solid;
-
- printf PO "%d,%d league %s %s \n", $x,$y,
- $solid?'solid':'dotted', $dirn;
- } elsif (
- m/^\{\{ chart\ head \}\}$/xi
- ) {
+@ARGV==1 or die;
+my $ocean= shift @ARGV;
+
+
+my $parity;
+sub nn_xy ($$) {
+ my ($x,$y) = @_;
+ my $tp= (0+$x ^ 0+$y) & 1;
+ defined $parity or $parity=$tp;
+ $tp==$parity or warning("line $.: parity error $x,$y is $tp not $parity");
+ my $n= "$_[0],$_[1]";
+ $winode2lines{$n}{$.}++;
+ return $n;
+}
+
+sub run_yppedia_chart_parse ($) {
+ my ($oceanfh) = @_;
+ yppedia_chart_parse($oceanfh, $debugfh,
+ \&nn_xy,
+ sub {
+ my ($x,$y,$arch) = @_;
+ push @wiarchlabels, [ $x,$y,$arch ];
+ },
+ sub {
+ my ($n, $island) = @_;
+ $wiisland2node{$island}= $n;
+ $winode2island{$n}= $island;
+ $widists->add_vertex($n);
+ $wiarchs->add_vertex($n);
+ },
+ sub {
+ my ($na, $nb, $solid) = @_;
+ $widists->add_weighted_edge($na, $nb, 1);
+ $wiarchs->add_edge($na, $nb) if $solid;
+ $wiarchs->add_edge($na, $nb) if $solid;
+ },
+ sub {
+ my ($lno,$l) = @_;
+ warning("line $l: ignoring incomprehensible: $l");
+ });
+}
+
+sub yppedia_graphs_add_shortcuts () {
+ # We add edges between LPs we know about, as you can chart
+ # between them. Yppedia often lacks these edges.
+ #
+ foreach my $p ($widists->vertices) {
+ my ($ax,$ay) = $p =~ m/^(\d+)\,(\d+)$/ or die;
+ my $add_shortcut= sub {
+ my $q= sprintf "%d,%d", $ax+$_[0], $ay+$_[1];
+ return unless $widists->has_vertex($q);
+ return if $widists->has_edge($p,$q);
+ printf $debugfh "%-5s league-shortcut %-5s\n", $p, $q;
+ $widists->add_weighted_edge($p,$q,1);
+ };
+ $add_shortcut->( 2,0);
+ $add_shortcut->(+1,1);
+ $add_shortcut->(-1,1);
+ }
+}
+
+sub yppedia_graphs_prune_boring () {
+ # Prune the LP database by eliminating boring intermediate vertices
+ foreach my $delete ($widists->vertices()) {
+ next if exists $winode2island{$delete};
+ my @neigh= $widists->neighbours($delete);
+ next unless @neigh==2;
+ my $weight= 0;
+ map { $weight += $widists->get_edge_weight($delete, $_) } @neigh;
+ $widists->add_weighted_edge(@neigh, $weight);
+ $widists->delete_vertex($delete);
+ printf $debugfh "%-5s elide %5s %-5s %2d\n", $delete, @neigh, $weight;
+ }
+}
+
+sub yppedia_graphs_check () {
+ # Check that it's connected.
+ foreach my $cc ($widists->connected_components()) {
+ next if 2*@$cc > $widists->vertices();
+ my $m= "disconnected league point(s):";
+ foreach my $n (@$cc) {
+ $m .= "\n LP $n, def. yppedia line(s): ".
+ join(',', sort keys %{ $winode2lines{$n} });
+ }
+ warning($m);
+ }
+}
+
+sub yppedia_archs_sourceinfo () {
+ # Assign archipelagoes according to the source-info file
+ foreach my $arch (sort keys %{ $oceans{$ocean} }) {
+ foreach my $islename (sort keys %{ $oceans{$ocean}{$arch} }) {
+ my $islenode= $wiisland2node{$islename};
+ if (!defined $islenode) {
+ error("island $islename in source-info but not in WP map");
+ next;
+ }
+ my $ccix= $wiarchs->connected_component_by_vertex($islenode);
+ my $oldarch= $wiccix2arch{$ccix};
+ error("island in $arch in source-info".
+ " connected to $oldarch as well: $islename")
+ if defined $oldarch && $oldarch ne $arch;
+ printf $debugfh "%-5s force-island-arch cc%-2d %-10s %s\n",
+ $islenode, $ccix, $arch, $islename;
+ $wiccix2arch{$ccix}= $arch;
+ }
+ }
+}
+
+sub yppedia_archs_chart_labels () {
+ # Assign archipelago labels to groups of islands
+ #
+ foreach my $label (@wiarchlabels) {
+ my ($ax,$ay,$arch) = @$label;
+ my $best_d2= 9999999;
+ my $best_n;
+# print $debugfh "$ax,$ay arch-island-search $arch\n";
+ $ay += 1; $ax += 2; # coords are rather to the top left of label
+ foreach my $vertex ($wiarchs->vertices()) {
+ next unless exists $winode2island{$vertex};
+ my $ccix= $wiarchs->connected_component_by_vertex($vertex);
+ my @cc= $wiarchs->connected_component_by_index($ccix);
+ my ($vx,$vy) = split /,/, $vertex;
+ my $d2= ($vx-$ax)*($vx-$ax) + ($vy-$ay)*($vy-$ay);
+ my $cmp= $best_d2 <=> $d2;
+ printf $debugfh "%2d,%-2d arch-island-search %5s d2=%4d cc%-2d".
+ " #cc=%2d cmp=%2d %s\n",
+ $ax,$ay, $vertex, $d2, $ccix, scalar(@cc), $cmp,
+ $winode2island{$vertex};
+ next unless $cmp > 0;
+ $best_n= $vertex;
+ $best_d2= $d2;
+ }
+ die 'no island vertices?!' unless defined $best_n;
+ my $ccix= $wiarchs->connected_component_by_vertex($best_n);
+ printf $debugfh
+ "%2d,%-2d arch-island-select %-5s d2=%4d cc%-2d %-10s %s\n",
+ $ax,$ay, $best_n, $ccix, $best_d2, $arch, $winode2island{$best_n};
+ my $desc= join "\n", map {
+ my $in= $winode2island{$_};
+ " LP $_". (defined $in ? ", $in" : "");
+ } sort $wiarchs->connected_component_by_index($ccix);
+
+ if (exists $wiccix2arch{$ccix} and $wiccix2arch{$ccix} ne $arch) {
+ error("archipelago determination failed, wrongly merged:\n".
+ " archipelago $arch\n".
+ " archipelago $wiccix2arch{$ccix}\n".
+ $desc);
+ next;
+ }
+ $wiccix2arch{$ccix}= $arch;
+# print "$ccix $arch ::\n$desc\n";
+ }
+}
+
+sub yppedia_archs_fillbynearest() {
+ # Assign islands not labelled above to archipelagoes.
+ #
+ # We do this by, for each connected component (set of islands
+ # linked by purchaseable charts), searching for the nearest other
+ # connected component which has already been assigned an arch.
+ # `Nearest' means shortest distance of unpurchaseable charts, in
+ # leagues.
+ #
+ # we need only consider vertices which weren't `boring intermediate
+ # vertices' (removed during optimisation as being of order 2)
+ my @ccs_useful= map {
+ [ grep { $widists->has_vertex($_) } @$_ ]
+ } $wiarchs->connected_components();
+
+ my @assignments;
+
+ foreach my $sourceccix (0..$#ccs_useful) {
+ next if defined $wiccix2arch{$sourceccix};
+ next unless $ccs_useful[$sourceccix];
+
+ my @sourcecc= $wiarchs->connected_component_by_index($sourceccix);
+ my @islandnodes= grep { $winode2island{$_} } @sourcecc;
+ next unless @islandnodes; # don't care, then
+
+ foreach my $islandnode (@islandnodes) {
+ printf $debugfh "%-5s arch-join-need cc%-2d %s\n",
+ $islandnode, $sourceccix, $winode2island{$islandnode};
+ }
+ my $best_dist= 9999999;
+ my ($best_target, $best_targetccix, $best_source);
+ foreach my $targetccix (0..$#ccs_useful) {
+ next unless defined $wiccix2arch{$targetccix}; # not helpful
+ next unless $ccs_useful[$targetccix];
+ foreach my $target ($wiarchs->
+ connected_component_by_index($targetccix)) {
+ next unless $widists->has_vertex($target);
+ foreach my $source (@sourcecc) {
+ my $target_dist= widist($target,$source);
+ next unless defined $target_dist;
+ next if $target_dist >= $best_dist;
+ $best_dist= $target_dist;
+ $best_source= $source;
+ $best_target= $target;
+ $best_targetccix= $targetccix;
+ }
+ }
+ }
+ die "no possible target ?!" unless defined $best_target;
+
+ my $arch= $wiccix2arch{$best_targetccix};
+ my $best_island= $winode2island{$best_target};
+ printf $debugfh "%-5s arch-join-to %-5s dist=%2d cc%-2d %-10s %s\n",
+ $best_source, $best_target, $best_dist,
+ $best_targetccix, $arch,
+ defined($best_island) ? $best_island : "-";
+
+ push @assignments, [ $sourceccix, $arch ];
+ }
+ foreach my $assign (@assignments) {
+ $wiccix2arch{$assign->[0]}= $assign->[1];
+ }
+}
+
+sub yppedia_graph_shortest_paths () {
+ $wialldists= $widists->APSP_Floyd_Warshall();
+}
+
+sub widist ($$) {
+ my ($p,$q) = @_;
+ my $pl= $wialldists->path_length($p,$q);
+# die "$p $q" unless defined $pl;
+# my @pv= $wialldists->path_vertices($p,$q);
+# if (@pv == $pl) { return $pl; }
+# printf $debugfh "%-5s PATHLENGTH %-5s pl=%s pv=%s\n", $p,$q,$pl,join('|',@pv);
+ return $pl;
+}
+
+sub winode2arch ($) {
+ my ($node) = @_;
+ my $ccix= $wiarchs->connected_component_by_vertex($node);
+ return $wiccix2arch{$ccix};
+}
+sub wiisland2arch ($) {
+ my ($island) = @_;
+ my $node= $wiisland2node{$island};
+ die "$island ?" unless defined $node;
+ return winode2arch($node);
+}
+
+sub compare_island_lists () {
+ foreach my $island (sort keys %dbisland2arch) {
+ my $node= $wiisland2node{$island};
+ if (!defined $node) {
+ error("would delete island: $island");
+ next;
+ }
+ my $wiarch= winode2arch($node);
+ if (!defined $wiarch) {
+ error("island has no arch: $island");