GitHub / SleekPanther / kruskals-algorithm-minimum-spanning-tree-mst
Kruskal's Algorithm (greedy) to find a Minimum Spanning Tree on a graph
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fkruskals-algorithm-minimum-spanning-tree-mst
PURL: pkg:github/SleekPanther/kruskals-algorithm-minimum-spanning-tree-mst
Stars: 4
Forks: 8
Open issues: 0
License: None
Language: Java
Size: 710 KB
Dependencies parsed at: Pending
Created at: over 8 years ago
Updated at: about 4 years ago
Pushed at: over 7 years ago
Last synced at: 6 months ago
Topics: disjoint-sets, edges, graph, graphs, greed, greedy, greedy-algorithm, greedy-algorithms, java, kruskal-algorithm, kruskals-algorithm, minimum, minimum-spanning-trees, mst, spanning, tree, undirected, weight, weighted