Re: treat pairs, set as one item: looking for better way

in reply to treat pairs, set as one item: looking for better way

Hello remiah!

It's a classical problem from graph theory.

Your pairs are edges and you wanna determine connectivity resp. connected components.

Don't know if the other posters are aware of edge cases (your example data is too simple to show them).

But there are already efficient (and proven) algorithms available!

Cheers Rolf

( addicted to the Perl Programming Language)

Comment on Re: treat pairs, set as one item: looking for better way

Replies are listed 'Best First'.
Re^2: treat pairs, set as one item: looking for better way by remiah (Hermit) on Oct 19, 2013 at 11:58 UTC
Hello LanX ! and oh my god !!! `#!/usr/bin/perl use Graph::Undirected; use strict; use warnings; my $g = Graph::Undirected->new; my @key_array = 'a' .. 'z'; my @set_array = ( ['a', 'b'], ['e','f'], ['f','g'] ); $g->add_vertex( $_ ) for @key_array; $g->add_edge( $_->[0], $_->[1] ) for @set_array; print "$_\n" for sort { length($b) <=> length($a) \|\| $a cmp $b } map {join( ',', @$_) } $g->connected_components;` [download] I totally forgot about Graph module until you tell me. I would like to read your pages you gave me. Really thanks for your reply.	[reply] [d/l]

Replies are listed 'Best First'.

Re^2: treat pairs, set as one item: looking for better way
by remiah (Hermit) on Oct 19, 2013 at 11:58 UTC

Hello LanX ! and oh my god !!!

#!/usr/bin/perl
use Graph::Undirected;
use strict; use warnings;
my $g = Graph::Undirected->new;
my @key_array = 'a' .. 'z';
my @set_array = ( ['a', 'b'],  ['e','f'], ['f','g'] );

$g->add_vertex( $_ ) for @key_array;
$g->add_edge( $_->[0], $_->[1] ) for @set_array;

print "$_\n" for  
    sort { length($b) <=> length($a) || $a cmp $b }
    map {join( ',',  @$_) } 
    $g->connected_components;
[download]

[reply]
[d/l]

In Section Seekers of Perl Wisdom