- Name: perl-Graph-Kruskal
- Version: 2.0
- Release: 10
- Epoch:
- Group: Development/Languages/Perl
- License: GPL v1+ or Artistic
- Url:
- Summary: Graph::Kruskal - Kruskal's algorithm for Minimal Spanning Trees in graphs
- Architecture: noarch
- Size: 9382
- Distribution: PLD 2.0 (Ac)
- Vendor: PLD
- Packager: PLD bug tracking system ( http://bugs.pld-linux.org/ )
Description:
Graph::Kruskal Perl module implements the Kruskal's algorithm for
Minimal Spanning Trees in graphs.
Computes the Minimal Spanning Tree of a given graph according to some
cost function defined on the edges of the graph.
- BuildArch:
- ExcludeArch:
- ExclusiveArch:
- Cookie: src.ac.pld-linux.org 1083930029
- Buildhost: src.ac.pld-linux.org
Generated packages:
Other version of this rpm: