Discrete Mathematics · Algebra & Patterning
Graph Theory Fundamentals
A graph models any pairwise relationship. BFS and DFS are fundamental algorithms; Eulerian paths visit every edge exactly once.
WHAT STUDENTS WILL LEARN
✓Define graphs and digraphs
✓Apply BFS and DFS
✓Determine Eulerian and Hamiltonian paths
✓Apply to scheduling and routing
COURSE OUTLINE · CLICK A PART FOR RESOURCES