Floyd算法的C&python实现及对比

久闻python大名，十分景仰。恰逢俺最近在学习python，今天就借Floyd算法来练练手，假设大家对多源最短路径——Floyd算法较熟悉，俺也不多废话，大家随我一同来感受python的魅力吧。
俺使用的实例是一个简单的4*4有向赋权连通图，参见俺的手绘图，程序功能是计算出任意两点最短路长度，并给出所有路径（采用回溯法，计算任意两点最短路径，依次给出给出中间点）：

//C语言实现Floyd算法
//作者：si1ver zhou_weilin@qq.com
//时间：2015.08.25
#include <stdio.h>
#include <memory.h>

#define N 4
#define INFI 100

int graph[N][N] = {{0,2,6,4},{INFI,0,3,INFI},{7,INFI,0,1},{5,INFI,12,0}};

void printM(int *p,int n)
{
    int i,j;
    for(i = 0;i < n;i++){
        for(j = 0;j < n;j++){
            printf("%5d",*(p+4*i+j));
        }
        printf("\n");
    }
}

void back_path(int *p,int n,int i,int j)    //回溯路径
{
    int k,rt;
    while(-1 != (k = *(p+4*i+j))){
        back_path(p,n,i,k);                 //先递归，后打印
        back_path(p,n,k,j);
        printf("%d",k);
        return ;
    }
    return ;
}

int main()
{
    int i,j,k;
    int path[N][N];
    memset(path,-1,N*N*sizeof(int));
//  printM(path[0],N);
    printf("Graph:\n");
    printM(graph[0],N);
    for(k = 0;k < N;k++){
        for(i = 0;i < N;i++){
            for(j = 0;j < N;j++){
                if(graph[i][j] > graph[i][k] + graph[k][j] && graph[i][k] != INFI && graph[k][j] != INFI){
                    graph[i][j] = graph[i][k] + graph[k][j];
                    path[i][j] = k;
                }
            }
        }
    }
    printf("Shortest distance:\n");
    printM(graph[0],N);
    printf("Path:\n");
    printM(path[0],N);

    printf("Points pass-by:\n");
    for(i = 0;i < N;i++){
        for(j = 0;j < N;j++){
            printf("%d -> %d:",i,j);
            back_path(path[0],N,i,j);       //i -> j的路径（回溯算法）
            printf("\n");
        }
    }
    return 0;
}

#-*- coding:utf-8 -*-
#python实现Floyd算法
#作者：si1ver zhou_weilin@qq.com
#时间：2015.08.25
N = 4
_=float('inf')      #无穷大
graph = [[ 0, 2, 6, 4],[ _, 0, 3, _],[ 7, _, 0, 1],[ 5, _,12, 0]]
path = [[-1,-1,-1,-1],[-1,-1,-1,-1],[-1,-1,-1,-1],[-1,-1,-1,-1]]        #记录路径，最后一次经过的点

def back_path(path,i,j):            #递归回溯
    while(-1 != path[i][j]):
        back_path(path,i,path[i][j])
        back_path(path,path[i][j],j)
        print path[i][j],
        return;
    return;

print "Graph:\n",graph
for k in range(N):
    for i in range(N):
        for j in range(N):
            if graph[i][j] > graph[i][k] + graph[k][j]:
                graph[i][j] = graph[i][k] + graph[k][j]
                path[i][j] = k
print "Shortest distance:\n",graph
print "Path:\n",path
print "Points pass-by:"
for i in range(N):
    for j in range(N):
        print "%d -> %d:" % (i,j),
        back_path(path,i,j)
        print "\n",

程序运行结果
C语言：

Python：