bellman_ford_test
13-Nov-2014 13:35:49

BELLMAN_FORD_TEST
  MATLAB version
  Test the BELLMAN_FORD library.

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
     2:            6
     3:           -4
     4:           -1
     5:            4
     6:           -2
     7:            2
     8:            8
     9:           -3
    10:            3

  The shortest distances:

     1:            0
     2:           -6
     3:           -2
     4:            3
     5:            0
     6:            0

  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.

13-Nov-2014 13:35:49
diary off