'Prims Algorithm for Minimum Spanning Trees' Video Lecture

Prims Algorithm for Minimum Spanning Trees

  • Course: Data Structures And Algorithms
  • Discipline: Computer Science and Engineering
  • Faculty: Prof. Naveen Garg
  • Institute: IIT Delhi

    • Prims Algorithm for Minimum Spanning Trees - Click on the Video Link shown below to play the video on Youtube. Browse through Data Structures And Algorithms (Computer Science and Engineering) Video Lectures by Prof. Naveen Garg from IIT Delhi through NPTEL.

    NEXT LECTURE >> Single Source Shortest Paths
    Download this video in MP4, FLV & 3GP formats
    Format  Size  Download
    MP4 299 MB MP4 Video Download Link 1
    MP4 299 MB MP4 Video Download Link 2
    FLV 168 MB FLV Video Download Link 1
    FLV 168 MB FLV Video Download Link 2
    3gp 74 MB 3gp Video Download Link 1
    3gp 74 MB 3gp Video Download Link 2
    Search Courses
    Course Video Lectures Introduction to Data Structures and Algorithm.. Stacks Queues and Linked Lists Dictionaries Hashing Trees Tree Walks / Traversals Ordered Dictionaries Deletion Quick Sort AVL Trees AVL Trees Trees Red Black Trees Insertion in Red Black Trees Disk Based Data Structures Case Study: Searching for Patterns Tries Data Compression Priority Queues Binary Heaps Why Sorting More Sorting Graphs Data Structures for Graphs Two Applications of Breadth First Search Depth First Search Applications of DFS DFS in Directed Graphs Applications of DFS in Directed Graphs Minimum Spanning Trees The Union Prims Algorithm for Minimum Spanning Trees Single Source Shortest Paths Correctness of Dijkstras Algorithm Single Source Shortest Paths
    2015. EngineeringVideoLectures.com