Objectives
- To learn
- To teach
Subsection one
As a pre-requisite for this lab activity, you should be familiar with the definition of a graph as a collection of vertices (also called nodes) and edges connecting them. Additionally you should be familiar with the two implementation strategies for a graph, namely, an adjacency matrix representation and adjacency lists. Finally you should be familiar with the general algorithm that is used to implement depth- and breadth-first graph traversals in terms of an open list and a closed list. To review this algorithm see the
![]() |





