DSA Lab 6 Fall 2009, 10/7/09

1. Using a DFS procedure to the Graph Class (Sample) and Sample Data (input) for unweighted graph. test whether a given graph is two colorable or not.
2. Using a DFS procedure, for the given input directed graph find the topological sorted numbers. (You can still use the same Graph.cc and your dfs procedure.) You may assume that there is exactly one source vertex (that is one vertex with ind-degree 0 and that will be ths atrting vertex.)
3. Optional - What algorithm (in chapter 1) reminds of you of this problem (problem number 4)and what is the answer? Problem reproduced below from Tieney's Monday Puzzle blog from the New York Times. Tierney Lab Blogs

   Here.s a final Diophantine limerick for our math whizzes.
   
   4.
   A small little equation do I satisfy,
   Add 24 times x to 36 times a different y,
   The equation sure is Diophantine,
   And x and y could be either sign
   I.m positive the smallest such one am I