https://github.com/titsuki/raku-algorithm-kruskal

Algorithm::Kruskal is a perl6 implementation of Kruskal's Algorithm for constructing a spanning subtree of minimum length
https://github.com/titsuki/raku-algorithm-kruskal

Last synced: 23 days ago
JSON representation

Algorithm::Kruskal is a perl6 implementation of Kruskal's Algorithm for constructing a spanning subtree of minimum length

• Host: GitHub
• URL: https://github.com/titsuki/raku-algorithm-kruskal
• Owner: titsuki
• License: artistic-2.0
• Created: 2016-03-22T14:41:53.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2024-08-08T13:12:07.000Z (11 months ago)
• Last Synced: 2025-03-21T23:11:27.522Z (4 months ago)
• Language: Raku
• Size: 16.6 KB
• Stars: 2
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: Changes
  • License: LICENSE

Awesome Lists containing this project

README

        
[![Actions Status](https://github.com/titsuki/raku-Algorithm-Kruskal/actions/workflows/test.yml/badge.svg)](https://github.com/titsuki/raku-Algorithm-Kruskal/actions)

NAME

====

Algorithm::Kruskal - a Raku implementation of Kruskal's Algorithm for constructing a spanning subtree of minimum length

SYNOPSIS

========

    use Algorithm::Kruskal;

    my $kruskal = Algorithm::Kruskal.new(vertex-size => 4);

    $kruskal.add-edge(0, 1, 2);

    $kruskal.add-edge(1, 2, 1);

    $kruskal.add-edge(2, 3, 1);

    $kruskal.add-edge(3, 0, 1);

    $kruskal.add-edge(0, 2, 3);

    $kruskal.add-edge(1, 3, 5);

    my %forest = $kruskal.compute-minimal-spanning-tree();

    %forest.say; # 3

    %forest.say; # [[1 2] [2 3] [3 0]]

DESCRIPTION

===========

Algorithm::Kruskal is a Raku implementation of Kruskal's Algorithm for constructing a spanning subtree of minimum length

CONSTRUCTOR

-----------

    my $kruskal = Algorithm::Kruskal.new(%options);

### OPTIONS

  * `vertex-size => $vertex-size`

Sets vertex size. The vertices are numbered from `0` to `$vertex-size - 1`.

METHODS

-------

### add-edge(Int $from, Int $to, Real $weight)

    $kruskal.add-edge($from, $to, $weight);

Adds a edge to the graph. `$weight` is the weight between vertex `$from` and vertex `$to`.

### compute-minimal-spanning-tree() returns List

    my %forest = $kruskal.compute-minimal-spanning-tree();

    %forest.say; # display edges

    %forest.say; # display weight

Computes and returns a minimal spanning tree and its weight.

AUTHOR

======

titsuki 

COPYRIGHT AND LICENSE

=====================

Copyright 2016 titsuki

This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0.

This algorithm is from Kruskal, Joseph B. "On the shortest spanning subtree of a graph and the traveling salesman problem." Proceedings of the American Mathematical society 7.1 (1956): 48-50.