动态规划之最短路径（Floyd算法）

 package main

 import (
     "fmt"
 )

 func floyd(m [][]int) {
     length := len(m[])
     var min, i, j int
     for k := ; k < length; k++ {
         for i = ; i < length; i++ {
             for j = ; j < length; j++ {
                 if m[i][k] >  && m[k][j] >  {
                     min = m[i][k] + m[k][j]
                     if min < m[i][j] || m[i][j] < {
                         m[i][j] = min
                     }
                 }
             }
         }
     }
     for i = ; i < length; i++ {
         for j = ; j < length; j++ {
             fmt.Print(m[i][j], "\t")
         }
         fmt.Println("")
     }
 }

 func main() {
     m := [][]int{{, , }, {, , -}, {, -, }}
     floyd(m)
 }