#include "p284.cpp"
void Graph::BellmanFord ( const int v ) {
//在帶權(quán)有向圖中有的邊具有負(fù)的權(quán)值。從頂點(diǎn)v找到所有其它頂點(diǎn)的最短路徑。
   for ( int i=0; i<n; i++ ) {
	 dist[i] = Edge[v][i];								//對(duì)dist初始化
	 if ( i != v && dist[i] < MAXINT ) path[i] = v;			//對(duì)dist初始化
	 else path[i] = -1;
   }
   dist[v]=0;
   for ( int k=2; k<n; k++ )
	 for ( int u=0; u<n; u++ )
	   if ( u != v )
		 for ( i=0; i<n; i++ )
		   if ( path[i] >=0 && Edge[i][u] < MAXINT && dist[u] > dist[i]+Edge[i][u] ) {
			   dist[u] = dist[i] + Edge[i][u];  path[u] = i;		//繞i的路徑長(zhǎng)度小，修改
		   }
}