Implementation of MST (Borůvka's) in C++

reichenbch / iGraphly

Implementation of Graph based algorithms with tutorials.

0 stars 0 forks source link

Open reichenbch opened 4 years ago

reichenbch commented 4 years ago

Implementation of MST (Minimum Spanning Tree - Kruskal's) algorithm in C++ with Object Oriented Programming principles (classes and structures).

Different time complexity - ( E - # Edges and V- # Vertices ) 1) O (E log V) Borůvka's

No main method creation, only the class object creation with testing module, if possible.

Proper commenting and instruction to run the module required.

reichenbch commented 4 years ago

This algorithm is also known as Sollin's Algorithm.