Skip to content

Latest commit

 

History

History
8 lines (5 loc) · 422 Bytes

README.md

File metadata and controls

8 lines (5 loc) · 422 Bytes

prim-algorithm

Question
Implement Greedy method (i.e.. Prim's algorithm) to find the minimum spanning tree of a given weighted undirected graph.

Hello Guys! If you encounter any issues with your code or system, feel free to contact me for assistance.You can reach me through email at aryan.sharma21@st.niituniversity.in or by phone at 7774885259. "Additionally, I can also assist with any digital aspects as well.