Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.
Course: Distributed Systems, Spring 2019
Taught by: Prof. Kishore Kothapalli
-
Notifications
You must be signed in to change notification settings - Fork 0
Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.
License
cppf/mpi-boruvka-mst
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.