Source Code : Program to find the shortes path

 _{Program to find the shortes path. */}

_#include

_#include

_{#define INF 9999}

_{void main( )}

_{

  _{int arr[4][4] ;}

  _{int cost[4][4] = {}

  _{7, 5, 0, 0,}

  _{7, 0, 0, 2,}

  _{0, 3, 0, 0,}

  _{4, 0, 1, 0}

  _{} ;}

  _{int i, j, k, n = 4 ;}

  _{clrscr( ) ;}

  _{for ( i = 0 ; i < n ; i++ )}

  _{

  _{for ( j = 0; j < n ; j++ )}

  _{

  _{if ( cost[i][j] == 0 )}

  _{arr[i][j] = INF ;}

  _else

  _{arr[i][j] = cost[i][j] ;}

  _}

  _}

  _{printf ( "Adjacency matrix of cost of edges:\n" ) ;}

  _{for ( i = 0 ; i < n ; i++ )}

  _{

  _{for ( j = 0; j < n ; j++ )}

  _{printf ( "%d\t", arr[i][j] ) ;}

  _{printf ( "\n" ) ;}

  _}

  _{for ( k = 0 ; k < n ; k++ )}

  _{

  _{for ( i = 0 ; i < n ; i++ )}

  _{

  _{for ( j = 0 ; j < n ; j++ )}

  _{

  _{if ( arr[i][j] > arr[i][k] + arr[k][j] )}

  _{arr[i][j] = arr[i][k] + arr[k][j];}

  _}

  _}

  _}

  _{printf ( "\nAdjacency matrix of lowest cost between the vertices:\n" ) ;}

  _{for ( i = 0 ; i < n ; i++ )}

  _{

  _{for ( j = 0; j < n ; j++ )}

  _{printf ( "%d\t", arr[i][j] ) ;}

  _{printf ( "\n" ) ;}

  _}

  _{getch( ) ;}

_}