Thread: prim algortihm

Code:

void prim(long W[n][n]){


	int i ,vnear,min,t;
	int nearest[5];
	int distance[5];

	for(i = 0;i <= 5;i++)
	{
		nearest[i] = 1;
		distance[i] = W[0][i];
	}
	for(t = 0;t<5;t++)
	{
		min = MAX_LENGTH;

		for(i = 0;i <= n;i++)
			if(0<=distance[i]<min)
			{
				min = distance[i];
				vnear = i;
				printf("\n%d from ",vnear);
			}

			distance[vnear] = -1;

			for(i =0 ;i<=n;i++)
				if(W[i][vnear] < distance[i])
				{
					distance[i] = W[i][vnear];
					nearest[i] = vnear;
					printf("%d length is %d\n",vnear);
				}
	}



}

whats wrong here i couldnt find it pls help me