view release on metacpan or  search on metacpan

README  view on Meta::CPAN

            foreach my $vertex ( @$cluster ) {
                print "  Cluster element: $$vertex \n";
            }
        }

DESCRIPTION
    This module is perl implementation of Markov Cluster Algorithm (MCL)
    based on Perl Data Language (PDL).

    MCL is algorithm of finding clusters of vertices in graph. More
    information about MCL can be found at <http://micans.org/mcl/>. There is
    also perl script implementing MCL - minimcl
    <http://www.micans.org/mcl/scripts/minimcl>.

    This module try to solve two problems:

    * easy integration MCL in perl scripts and modules. Algorithm::MCL
      accept references as input and every reference will be found later in
      some cluster.

    * performance and scale. Algorithm::MCL use Perl Data Language for most

lib/Algorithm/MCL.pm  view on Meta::CPAN

        print "Found Cluster\n";
        foreach my $vertex ( @$cluster ) {
            print "  Cluster element: $$vertex \n";
        }
    }

=head1 DESCRIPTION

This module is perl implementation of Markov Cluster Algorithm (MCL) based on Perl Data Language (PDL).

MCL is algorithm of finding clusters of vertices in graph. More information about MCL can be found at L<http://micans.org/mcl/>. There is also perl script implementing MCL - minimcl L<http://www.micans.org/mcl/scripts/minimcl>.

This module try to solve two problems:

=over 2

=item *

easy integration MCL in perl scripts and modules. Algorithm::MCL accept references as input and every reference will be found later in some cluster.

=item *