int Dijstra(int a, int b)
{
	int i, j, mini, h, w;
	int d[1001];
	for(i = 0; i <= n; i++)
	{
		d[i] = 0;
		flag[i] = 0;
	}
	d[a] = maxnum;
	for(i = 0; i < n; i++)
	{
		mini = -1;
		for(j = 1; j <= n; j++)
		{
			if(flag[j] == 0 && d[j] > 0)
			{
				mini = d[j];
				h = j;
				break;
			}
		}
		if(mini == -1)break;
		else flag[h] = 1;
		for(j = 1; j <= n; j++)
		{
			if(flag[j] == 0 && matrix[h][j] != maxnum)
			{
				w = d[h] < matrix[h][j] ? d[h] : matrix[h][j];
				d[j] = d[j] > w ? d[j] : w;
			}
		}
	}
	return d[b];
}

• Re::)我这么做对么？貌似思路应该没错，可是wa.. (1062) 1050310209 2007-02-24 19:14:05