+# print "$ccix $arch ::\n$desc\n";
+ }
+
+ # 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.
+
+ # fixme need some hints
+
+ # 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();
+
+ foreach my $sourceccix (0..$#ccs_useful) {
+ next if defined $wiccix2arch{$sourceccix};
+
+ my $sourcecc= $ccs_useful[$sourceccix];
+ my @islandnodes= grep { $winode2island{$_} } @$sourcecc;
+ next unless @islandnodes; # don't care, then
+
+ my $best_dist= 9999999;
+ my $best_target;
+ foreach my $targetccix (0..$#ccs_useful) {
+ next unless defined $wiccix2arch{$targetccix}; # not helpful
+ my $targetcc= $ccs_useful[$targetccix];
+ foreach my $target (@$targetcc) {
+ foreach my $source (@$sourcecc) {
+ my $target_dist= $wialldists->path_length($target,$source);
+ next if $target_dist >= $best_dist;
+ $best_dist= $target_dist;
+ $best_target= $target;
+ }
+ }
+ }
+# die "no possible target ?!" unless defined $best_target;
+#
+# printf DEBUG "
+#
+# foreach my $node (sort keys %winode2island) {
+# my $island= $winode2island{$node};
+# my $arch= winode2arch($node);
+# next if defined $arch;
+# my $ccix= $wiarchs->connected_component_by_vertex($node);
+# my @cc= $wiarchs->connected_component_by_index($ccix);
+# @cc= grep { defined $winode2island{$_} } @cc;
+# # We search for the best:
+# # - member of this connected component