Minimizing Cost Travel in Multimodal Transport Using Advanced Relation Transitive Closure

Algorithm 2

Lowest cost in multimodal transport graph.

Input: Two matrices representing the two transport mode graphs

Output: Canonical form of the matrix that represents the merge multimodal graph

Do  

// : Use any algorithm which computes the simple

transitive closure of . Next, we use Floyd-Warshall.

For  i:

  For  j:

  For  k:      

// : Update MR using MS

For  i: 1 n

  For  j:

If      then

  for  k:

If   then

// : entire part of

End if  

End if    

  While  ()