Skip to content

Raahitya-14/Minimum-spanning-Forest

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

DD2440 Minimum spanning Forest

This Repository contains the final project in DD2440 Advanced Algorithms at KTH. For this project, our goal was to develop a sub-linear time algorithm for estimating the weight of a minimum-spanning forest (MSF) with a maximum a relative error of 0.1 in either direction.

Team members:

About

Final project in DD2440 Advanced Algorithms at KTH.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages