poj 1797

问题描述： n个顶点 的连通图顶点编号[1, n], 找到从顶点1到顶点n的最大运载量。例如： a--->b----->c，a到c的最大运载量由min{w[a][b]，w[b][c]}决定。该题的解法是dijkstra单源最短路径算法的变形，进行节点松弛时候的方式不同，要注意两者的区别。下面示例中红色的部分是对节点进行松弛。

#include<iostream>
#include<cstdio>
#include<fstream>

using namespace std;

#define NODES 1001

static int n, m;
static int matrix[NODES][NODES];
static int heavist[NODES];
static int isok[NODES];

void search_heavist(void)
{
	int i, j;
	heavist[1] = 0;	isok[1] = 1;
	for (i = 2; i <= n; i++)  /* initialize the search */
	{
		heavist[i] = matrix[1][i];
		isok[i] = 0;
	}

	for (i = 1; i <= n - 1; i++)
	{
		int max  = -1;
	        int maxi = -1;

		/* peak the heaviest node */
		for (j = 1; j <= n; j++)
		{
			if (isok[j]==0 && heavist[j] > max)
			{	max = heavist[j];	maxi = j;	}
		}
	
                isok[maxi] = 1;	 /* mark the picked nodes */
        
		/* Relax node */
		for (j = 1; j <= n; j++)
		{
			if (isok[j] == 0)
			{
				<span style="color:#ff0000;"> int tmp = matrix[maxi][j];
				 if (heavist[maxi] < matrix[maxi][j]) /* 1---->maxi --->j */
					 tmp = heavist[maxi];
				 if (heavist[j] < tmp)
					 heavist[j] = tmp;</span>
			}  
		}
	}
}

int main()
{
	int t;
	int scenario = 0;
	cin >> t;
	while (t-- > 0)
	{
		int i;
		int u, v, w;
		memset(matrix, 0, sizeof matrix);
		cin >> n >> m;
		for (i = 0; i < m; i++)
		{
			cin >> u >> v >> w;
			matrix[u][v] = w;
			matrix[v][u] = w;
		}
		search_heavist(); //search the graph 
		printf("Scenario #%d:\n%d\n\n", ++scenario, heavist[n]);
	}
	return 0;
}