Algorithm-MCL
view release on metacpan or search on metacpan
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
of its processing and should run very fast on very big clusters. Main
Algorithm::MCL procedures are written with "pdlpp".
METHODS
new()
create new Algorithm::MCL object that accumulate graph edges and process
data.
addEdge($ref1, $ref2, $distance)
add new edge to graph. first two parameters are reference to vertex
objects. third parameter is "connection strength measurement" between
vetices. "connection strength measurement" should be number between 0
and 1, higher number means stronger connectivity. if "connection
strength measurement" is not defined it set to 1.
run()
lib/Algorithm/MCL.pm view on Meta::CPAN
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 *
performance and scale. Algorithm::MCL use Perl Data Language for most of its processing and should run very fast on very big clusters. Main Algorithm::MCL procedures are written with "pdlpp".
=back
=head1 METHODS
=head2 new()
create new Algorithm::MCL object that accumulate graph edges and process data.
=head2 addEdge($ref1, $ref2, $distance)
add new edge to graph. first two parameters are reference to vertex objects. third parameter is "connection strength measurement" between vetices. "connection strength measurement" should be number between 0 and 1, higher number means stronger connec...
=head2 run()
apply MCL algorithm on graph. return reference to array that every element is reference to cluser array.
=head1 AUTHOR
( run in 0.331 second using v1.01-cache-2.11-cpan-8d75d55dd25 )