Dijkstra's algorithm

http://www.algolist.com/code/c/Dijkstra's_algorithm

/* Written by Sanchit Karve (born2c0de)

   Contact me on born2c0de AT dreamincode DOT net

*/

#include <stdio.h>

#define MAX 7

#define INFINITE 998

int allselected(int *selected)

{

  int i;

  for(i=0;i<MAX;i++)

    if(selected[i]==0)

      return 0;

  return 1;

}

void shortpath(int cost[][MAX],int *preced,int *distance)

{

  int selected[MAX]={0};

  int current=0,i,k,dc,smalldist,newdist;

  for(i=0;i<MAX;i++)

    distance[i]=INFINITE;

  selected[current]=1;

  distance[0]=0;

  current=0;

  while(!allselected(selected))

  {

    smalldist=INFINITE;

    dc=distance[current];

    for(i=0;i<MAX;i++)

    {

      if(selected[i]==0)

      {                                             

        newdist=dc+cost[current][i];

        if(newdist<distance[i])

        {

          distance[i]=newdist;

          preced[i]=current;

        }

        if(distance[i]<smalldist)

        {

          smalldist=distance[i];

          k=i;

        }

      }

    }

    current=k;

    selected[current]=1;

   }

}

int main()

{

  int cost[MAX][MAX]= 

     {{INFINITE,2,4,7,INFINITE,5,INFINITE},

      {2,INFINITE,INFINITE,6,3,INFINITE,8},

      {4,INFINITE,INFINITE,INFINITE,INFINITE,6,INFINITE},

      {7,6,INFINITE,INFINITE,INFINITE,1,6},

      {INFINITE,3,INFINITE,INFINITE,INFINITE,INFINITE,7},

      {5,INFINITE,6,1,INFINITE,INFINITE,6},

      {INFINITE,8,INFINITE,6,7,6,INFINITE}};

  int i,preced[MAX]={0},distance[MAX];

  shortpath(cost,preced,distance);

  for(i=0;i<MAX;i++)

    printf("%d\n",distance[i]);

  return 0;

}