Skip to main content

Popular posts from this blog

Summer Research Internship Program (SRIP) 2021 at IIT Gandhinagar

  The Summer Research Internship Program, also known as SRIP, is conducted by the Indian Institute of Technology Gandhinagar (IITGn), one of the most prestigious institutions of India. This internship is highly sought after by students because of the learning and networking opportunities offered by this Research Internship. In this blog, I will be walking you through my experience in SRIP 2021. Before proceeding, I just want to clarify that it is highly recommended to check the website of SRIP for eligibility, duration, stipend, projects available, etc. Basic details of SRIP at IITGn Duration: 8 Weeks Eligibility: Students pursuing Bachelor's and Master's degree at any prominent institute in India. First-year students, as well as Final year students, can apply. Stipend: 2000 INR per Week Note- It is strongly recommended to the reader to check the SRIP website thoroughly because these details might change. I am a student pursuing B.Sc. (Hons.) Biochemistry from Sri Venkateswara
1 comment
Read more

Prim's Algorithm

  Prim's Algorithm is a greedy algorithm that finds a minimum spanning tree for weighted undirected graphs. Spanning Trees: Retain a minimal set of edges so that graphs remain connected. A tree is a minimally connected graph. Adding an edge to a tree creates a loop and removing an edge disconnects the graph. In this graph, the red edges form a Spanning tree Minimum Cost Spanning Tree: Add the cost of all the edges in the Tree Amount different spanning trees, choose the one with a minimum one Finding Minimum Cost Spanning Trees using Prim's Algorithm Strategy: Incrementally grow the minimum cost spanning tree Start with the smallest weight edge overall Extend the current tree by adding the smallest edge from the vertex of the tree to a vertex not yet reached For example, consider: Start with the smallest edge which is between Vertex 1 and Vertex 3 in the above given example. After this, we can extend the tree by choosing edges that are connected with Vertex 1 and Vertex 3. This
Post a Comment
Read more