Graphs can be traversed using a variety of different algorithms. Graph traversal requires an algorithm that visits all nodes of a graph. Tree traversal is a special subset of graph traversal. The ones relevant to CPSC 221 are: Breadth First Search Depth First Search Prim’s Algorithm Dijkstra’s Kruskal’s Algorithm