Introduction

Module 9:8: AdvancedOOP Graph(SOLID, Encapsulation, Abstraction)

Author:Created by: YP

---

Learning Objectives

After completing this module, students are expected to be able to:

1. Explain the basic conceptsconcept of GraphOOP (includingObject-Oriented adjacency list and adjacency matrix representation)Programming).
2. ImplementDifferentiate graph traversal usingbetween DFS (Depth First Search)Encapsulation and BFS (Breadth First Search).
3. Understand and implement the Shortest Path algorithm (Dijkstra)Abstraction.
4. Implement MinimumAbstract Spanning Tree (MST) algorithms: PrimClass and KruskalPure Virtual Function in C++.
5. CompareApply the efficiency of manual graph algorithms with STL libraries such asfundamental priority_queueSOLID principles (Single Responsibility Principle and Liskov Substitution Principle).
6. Build a simple disjointmenu-based setprogram unionusing (DSU).inheritance.

---