Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain the Prim's algorithms used to find the minimum spanning tree in a graph. We also explain about spanning trees in graphs followed by the implementation and code of this algorithm in a problem where:
1. You are given a graph and a source vertex. The vertices represent computers and the edges represent length of LAN wire required to connect them.
2. You are required to find the minimum length of wire required to connect all PCs over a network. Print the output in terms of which all PCs need to be connected, and the length of wire between them.
For output, check the video.
For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation
#graphs #prims #spanningtree
Have a look at our result: https://www.pepcoding.com/placements
Follow us on our FB page: https://www.facebook.com/pepcoding
Follow us on Instagram: https://www.instagram.com/pepcoding
Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education
Join us on Telegram: https://t.me/joinchat/UVTjJE83a-zFnPB
