GitHub / SleekPanther / reverse-delete-algorithm
Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Freverse-delete-algorithm
Stars: 1
Forks: 3
Open issues: 0
License: None
Language: Java
Size: 123 KB
Dependencies parsed at: Pending
Created at: over 7 years ago
Updated at: about 1 year ago
Pushed at: over 7 years ago
Last synced at: about 2 months ago
Topics: algorithm, algorithm-design, algorithms, edge, graph, greedy, greedy-algorithms, minimum-spanning-tree, minimum-spanning-trees, mst, noah, noah-patullo, noahpatullo, pattullo, pattulo, patullo, patulo, reverse-delete, reverse-delete-algorithm, tree