SWE 437 In Class Exercise # 18
More Graph Coverage

Again consider the following graph and test paths. This is the same graph as the exercise last class; today we are focusing on direct coverage vs. sidetrips.

N  = { 1, 2, 3, 4, 5, 6, 7, 8 }
N0 = { 1 }
Nf = { 8 }
E  = { (1, 2), (2, 3) (2, 8), (3, 4), (3, 5),
       (4, 3), (5, 6) (5, 7), (6, 7), (7, 2) }

t1 = [1, 2, 8]
t2 = [1, 2, 3, 5, 7, 2, 8]
t3 = [1, 2, 3, 5, 6, 7, 2, 8]
t4 = [1, 2, 3, 4, 3, 5, 7, 2, 8]
t5 = [1, 2, 3, 4, 3, 4, 3, 5, 6, 7, 2, 8]
t6 = [1, 2, 3, 4, 3, 5, 7, 2, 3, 5, 6, 7, 2, 8]

1. Identify all of the simple paths between the following nodes. You should get a total of 5.
   • 1 and 6
   • 1 and 8
   • 4 and 6
   • 4 and 8
2. Fill in the following table:
   
   
   

   Test Path	Simple Paths Toured Directly	Simple Paths Toured Only With a Sidetrip
   t1
   t2
   t3
   t4
   t5
   t6