Differences

This shows you the differences between two versions of the page.

Link to this comparison view

courses:cs211:winter2014:journals:stephen:home:chapter-3.2 [2014/01/28 23:48] โ€“ created rowleyscourses:cs211:winter2014:journals:stephen:home:chapter-3.2 [2014/01/28 23:49] (current) โ€“ rowleys
Line 35: Line 35:
  
 For any two nodes s and t in a graph, their connected components are either identical or disjoint. For any two nodes s and t in a graph, their connected components are either identical or disjoint.
 +
 +
 +This is important - look at p.85 for help with DFS.  9/10.
  
  
courses/cs211/winter2014/journals/stephen/home/chapter-3.2.1390952933.txt.gz ยท Last modified: by rowleys
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0