2 September 2021  10:15:11.687 AM

bellman_ford_test():
  FORTRAN90 version
  Test bellman_ford().

test01()::
  Bellman-Ford shortest path algorithm.

  Number of vertices =    6
  Number of edges =   10
  The reference vertex is    1
 
  The edge array:
 
  Row        1       2
  Col
 
    1:       2       1
    2:       5       2
    3:       2       3
    4:       3       5
    5:       5       1
    6:       3       6
    7:       6       1
    8:       4       3
    9:       6       4
   10:       4       1
 
  The edge weights:
 
         1:   -3.0000000    
         2:    6.0000000    
         3:   -4.0000000    
         4:   -1.0000000    
         5:    4.0000000    
         6:   -2.0000000    
         7:    2.0000000    
         8:    8.0000000    
         9:   -3.0000000    
        10:    3.0000000    
 
  The shortest distances:
 
         1:    0.0000000    
         2:   -6.0000000    
         3:   -2.0000000    
         4:    3.0000000    
         5:    0.0000000    
         6:    0.0000000    
 
  The vertex predecessor parents for the shortest paths:
 
         1:            -1
         2:             3
         3:             6
         4:             1
         5:             2
         6:             4

bellman_ford_test():
  Normal end of execution.

 2 September 2021  10:15:11.687 AM