Section outline


    • Topics of discussion  

      1. Discussion on Minimum Spanning Tree (MST)
      2. Discussion on Single Source Shortest Path

      Expected Learning Outcome 

      1. Solve MST using Kruskal’s Algorithm
      2. Solve MST using Prim’s Algorithm
      3. Single-Source Shortest Path(SSSP) by Dijkstra’s Algorithm

    • Week-11 Plan

      Week plan

      Topics

      Materials  

      Week-11: Lecture-01

      MST: Kruskal’s Algorithm          
      MST: Prim’s Algorithm

      Week-11: Lecture-02

      SSSP: Dijkstra’s Algorithm





    • forum icon
      Discussion on Week-11 Forum

      Discuss on Week-11 content if you have any problem and confusion. 

    • resource icon
      Graph File
      Students must
      Mark as done
    • resource icon
      BFS File
      Students must
      Mark as done
    • resource icon
      DFS File
      Students must
      Mark as done
    • resource icon
      TS File
      Students must
      Mark as done
    • resource icon
      SCC File
      Students must
      Mark as done
    • resource icon
      Kruskal File
      Students must
      Mark as done
    • resource icon
      Prims File
      Students must
      Mark as done
    • resource icon
      Dijkstra File
      Students must
      Mark as done
    • resource icon
      Exercise File
      Students must
      Mark as done