Page 278, Exercise 4

The table below lists all of the simple paths. Since there is a path from each node to every other node, the graph is strongly connected.

V i   V j       V i->V j             V j->V i                            
                                                             
0   1			 <0,1>               <1,2><2,0> 
0   2           <0,1><1,2>          <2,0> 
0   3           <0,3>               <3,2><2,0> 
1   2           <1,2>               <2,0><0,1> 
1   3           <1,2><2,0>,<0,3>    <3,2><2,0><0,1> 
2   3           <2,0><0,3>          <3,2>