1. Introduction

Module 9: Advanced Graph 
 Author: YP 
 Learning Objectives 
 After completing this module, students are expected to be able to: 
 
 Explain the basic concepts of Graph (including adjacency list and adjacency matrix representation). 
 Implement graph traversal using DFS (Depth First Search) and BFS (Breadth First Search) . 
 Understand and implement the Shortest Path algorithm (Dijkstra) . 
 Implement Minimum Spanning Tree (MST) algorithms: Prim and Kruskal . 
 Compare the efficiency of manual graph algorithms with STL libraries such as priority_queue and disjoint set union (DSU) .