CSE 373: Data Structures and Algorithms

Autumn 1994

Test Data for Programming Assignment 3

  
  Nothing's intended to be tricky here!  Also, I might have  goofed
  -- double check!
  
  The  following  is intended to be the left-most graph  in  Figure
  9.69 in the text:
  
  6
  1 2 2 3
  2 3 3 4 5
  3 2 4 6
  4 2 5 6
  5 1 6
  6 0
  
  The following is intended to be the center graph in Figure 9.69:
  
  7
  1 2 2 3
  2 3 3 4 5
  3 2 4 6
  4 2 5 6
  5 2 6 7
  6 1 7
  7 0
  
  The following is intended to be the right-most graph in Figure
  9.69:
  
  5
  1 3 2 3 4
  2 2 3 5
  3 2 4 5
  4 1 5
  5 0
  
  The following is intended to be the graph in Figure 9.70:
  
  12
  1 2 3 4
  2 2 3 8
  3 4 4 6 7 9
  4 4 5 7 10 11
  5 1 10
  6 1 9
  7 2 9 10
  8 1 9
  9 2 10 12
  10 2 11 12
  11 0
  12 0
  
  Finally, the following is intended to be the left-hand graph in
  Figure 9.85:
  
  5
  1 4 2 3 4 5
  2 3 3 4 5
  3 2 4 5
  4 1 5
  5 0

  And then there's a 0 denoting that there are no more graphs:

  0