Prim's Algorithm Courses and Certifications

Sundeep Saradhi Kanthety

Prim's Algorithm - Finding Minimum Cost Spanning Tree

Explore Prim's algorithm for finding minimum cost spanning trees using the greedy method in design and analysis of algorithms, with step-by-step explanations and examples.

• YouTube
• 39 minutes
• On-Demand
• Free Video

IISc Bangalore;  NPTEL

Introduction to Graph Algorithms

Learn essential graph algorithms for solving real-world problems in networks, including DFS, BFS, MST, and shortest path algorithms. Gain practical skills applicable to communication, social, and transportation networks.

• Swayam
• 8 weeks
• On-Demand
• Free Online Course

Great Learning

Prim's Algorithm in Java

Learn Prim's Algorithm for finding minimal spanning trees using Java, covering greedy programming concepts and practical implementation with detailed explanations and code examples.

• YouTube
• 38 minutes
• On-Demand
• Free Video

Graphs and Networks

Explore graph theory fundamentals, adjacency matrices, and efficient algorithms like Kruskal's and Prim's for solving network optimization problems.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Great Learning

Greedy Programming in Java

Learn greedy programming in Java, covering concepts, examples, and implementations of Fractional Knapsack and Prim's Algorithm for minimal spanning trees. Gain practical skills in solving optimization problems efficiently.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Non Linear Data Structures - Complete Non Linear Data Structures - Data Structures Part-2

Comprehensive exploration of non-linear data structures, covering trees and graphs. Learn terminology, representations, traversals, and algorithms for binary trees, BSTs, AVL trees, and graph operations.

• YouTube
• 6 hours 24 minutes
• On-Demand
• Free Video

Algorithms: Design and Analysis, Part 2

19 reviews

Explore advanced algorithm design techniques including greedy algorithms, dynamic programming, and NP-completeness. Gain practical skills for solving complex computational problems efficiently.

• Coursera
• 7 weeks, 6-10 hours a week
• Finished
• Free Online Course (Audit)