Skip to content

Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.

License

Notifications You must be signed in to change notification settings

cppf/mpi-boruvka-mst

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.

Course: Distributed Systems, Spring 2019
Taught by: Prof. Kishore Kothapalli

About

Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.

Resources

License

Stars

Watchers

Forks

Languages