as

 END OF READING
 NUMBER OF NODES = 25, NUMBER OF ARCS = 58
 CONSTRUCT LINKED LISTS FOR THE PROBLEM
 CALLING RELAX4 TO SOLVE THE PROBLEM
 ***********************************
 TOTAL SOLUTION TIME =  0. SECS.
 TIME IN INITIALIZATION =  0. SECS.
   1 6  15.
   1 10  32.
   1 14  32.
   1 18  32.
   1 22  46.
   2 4  16.
   4 6  6.
   6 8  11.
   10 12  16.
   14 16  16.
   18 20  16.
   22 24  30.
   3 5  11.
   5 7  12.
   7 9  13.
   9 11  12.
   11 13  12.
   13 15  11.
   15 17  8.
   17 19  5.
   19 21  5.
   21 23  9.
   23 25  15.
   4 5  10.
   6 7  10.
   8 9  10.
   8 9  1.
   10 11  10.
   10 11  6.
   12 13  10.
   12 13  6.
   14 15  10.
   14 15  6.
   16 17  10.
   16 17  6.
   18 19  10.
   18 19  6.
   20 21  10.
   20 21  6.
   22 23  10.
   22 23  6.
   24 25  10.
   24 25  4.
 OPTIMAL COST =   25843.
 NUMBER OF AUCTION/SHORTEST PATH ITERATIONS = 85
 NUMBER OF ITERATIONS =  88
 NUMBER OF MULTINODE ITERATIONS =  27
 NUMBER OF MULTINODE ASCENT STEPS =  13
 NUMBER OF REGULAR AUGMENTATIONS =  14
 ***********************************