search

kaustubhgupta / Hacktoberfest

This is for the information that the repository has been excluded by the Hacktoberfest team from the event. This was done to maintain the quality standards and promote good quality open source contributions.
MIT License
55 stars 277 forks source link

Minimum spanning tree algorithms - Prim's and Kruskal's #265

Closed ManasUniyal closed 4 years ago

ManasUniyal commented 4 years ago

Minimum spanning tree algorithms - Prim's and Kruskal's

Describe the solution you'd like A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted un-directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. There are two greedy algorithms - Prim's and Kruskal's to solve this problem.

Additional context Minimum spanning trees have direct applications in the design of networks, including computer networks, telecommunications networks, transportation networks, water supply networks, and electrical grids.

Languages

github-actions[bot] commented 4 years ago

Congrats for creating your first issue here! Wait till our mentors assign this issue to you. In the meantime have a look at contribution guidlines to avoid any PR rejection! (Rules are strict here)

kaustubhgupta commented 4 years ago

@ManasUniyal Assigned.

theDeepanshuMourya commented 4 years ago

I want to contribute to this for Java Project @kaustubhgupta

rgarg-2711 commented 4 years ago

can you please assign me it for c++?

kaustubhgupta commented 4 years ago

@rgarg-2711 This is already taken up in c++. You can only choose C or Python

rgarg-2711 commented 4 years ago

can I choose it for C?

kaustubhgupta commented 4 years ago

@rgarg-2711 okay assigned to you in C