GHS Algorithm

Python3 implementation of distributed GHS algorithm. GHS algorithm is the classical distributed algorithm constructing a minimum spanning tree in a graph with weights assigned to its edges

GHS_Jupyter.py is the main code file!

Name		Name	Last commit message	Last commit date
__pycache__		__pycache__
test_cases		test_cases
GHS_jupyter.py		GHS_jupyter.py
Graph.py		Graph.py
README.md		README.md
Report.pdf		Report.pdf
Report_assignment.pdf		Report_assignment.pdf
filecompare.py		filecompare.py
ghs_message.svg		ghs_message.svg
ghs_time.svg		ghs_time.svg
output		output
thread_passing		thread_passing
thread_passing.py		thread_passing.py

Navigation Menu

Repository files navigation

GHS Algorithm

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

GHS Algorithm

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages