Skip to content

PWrGitHub194238/BinaryRIMST

Repository files navigation

BinaryIMST

A master degree thesis for University of Technology, academic year 2016/2017, semester X. C++ (C++1y) library which solves Incremental Minimum Spanning Tree Problem based on Lagrangian relaxation and binary search algorithm, adversarial version of this problem and robust incremental minimum spanning tree problem based on them both.