Graph-ChuLiuEdmonds

This module implements Chu-Liu-Edmonds algorithm for finding minimum
spanning trees (MSTs) in a directed graph. It uses the module
Graph::Directed to represent weighted directed graphs.

INSTALLATION

To install this module, run the following commands:

    perl Makefile.PL
    make
    make test
    make install


SUPPORT AND DOCUMENTATION

After installing, you can find documentation for this module with the perldoc command.

    perldoc Graph::ChuLiuEdmonds

You can also look for information at:

    Search CPAN
        http://search.cpan.org/dist/Graph-ChuLiuEdmonds

    CPAN Request Tracker:
        http://rt.cpan.org/NoAuth/Bugs.html?Dist=Graph-ChuLiuEdmonds

    AnnoCPAN, annotated CPAN documentation:
        http://annocpan.org/dist/Graph-ChuLiuEdmonds

    CPAN Ratings:
        http://cpanratings.perl.org/d/Graph-ChuLiuEdmonds

ACKNOWLEDGEMENTS

The development of this module was supported by grant GA AV ÈR 1ET101120503.

COPYRIGHT AND LICENCE

Copyright (C) 2008 Petr Pajas

This program is free software; you can redistribute it and/or modify it
under the same terms as Perl itself.
