Computer Algorithms II Lecture Notes

6 November 2008 • Graph Basics


“Visited” in this case is best interpreted as meaning “worked on,” as in “print the data in every node in a graph.” Each node’s data should be printed once, but it may be necessary to visit the node several times to, for example, figure out which child to visit next.


This page last modified on 24 January 2006.