PKU ACM poj 1459 源代码

最新推荐文章于 2025-08-22 16:50:37 发布

原创最新推荐文章于 2025-08-22 16:50:37 发布 · 381 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#network #struct #input #output #each #path

本文介绍了一种基于Ford-Fulkerson算法的最大流问题求解方法，并通过Edmonds-Karp算法优化了搜索增广路径的过程。文章详细展示了如何利用深度优先搜索（DFS）和广度优先搜索（BFS）来寻找残余网络中的路径，并通过具体实例说明了如何计算电力网络中能被消费的最大电量。

最大流问题，采用Ford-Fulkerson算法。

在初始化的时候记录每个点的正向邻节点和反向邻节点,并增加一个源点和一个汇点.

开始使用DFS搜索增广路径，结果会超时，

改用BFS搜索，则可以ACCEPT，也就是要使用Edmonds-Karp算法。

另外，在输入时要使用int型的变量，否则会出现错误。

/*Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 12224 Accepted: 6697 Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <= p(u) <= pmax(u) of power, may consume an amount 0 <= c(u) <= min(s(u),cmax(u)) of power, and may deliver an amount d(u)=s(u)+p(u)-c(u) of power. The following restrictions apply: c(u)=0 for any power station, p(u)=0 for any consumer, and p(u)=c(u)=0 for any dispatcher. There is at most one power transport line (u,v) from a node u to a node v in the net; it transports an amount 0 <= l(u,v) <= lmax(u,v) of power delivered by u to v. Let Con=Σuc(u) be the power consumed in the net. The problem is to compute the maximum value of Con. An example is in figure 1. The label x/y of power station u shows that p(u)=x and pmax(u)=y. The label x/y of consumer u shows that c(u)=x and cmax(u)=y. The label x/y of power transport line (u,v) shows that l(u,v)=x and lmax(u,v)=y. The power consumed is Con=6. Notice that there are other possible states of the network but the value of Con cannot exceed 6. Input There are several data sets in the input. Each data set encodes a power network. It starts with four integers: 0 <= n <= 100 (nodes), 0 <= np <= n (power stations), 0 <= nc <= n (consumers), and 0 <= m <= n^2 (power transport lines). Follow m data triplets (u,v)z, where u and v are node identifiers (starting from 0) and 0 <= z <= 1000 is the value of lmax(u,v). Follow np doublets (u)z, where u is the identifier of a power station and 0 <= z <= 10000 is the value of pmax(u). The data set ends with nc doublets (u)z, where u is the identifier of a consumer and 0 <= z <= 10000 is the value of cmax(u). All input numbers are integers. Except the (u,v)z triplets and the (u)z doublets, which do not contain white spaces, white spaces can occur freely in input. Input data terminate with an end of file and are correct. Output For each data set from the input, the program prints on the standard output the maximum amount of power that can be consumed in the corresponding network. Each result has an integral value and is printed from the beginning of a separate line. Sample Input 2 1 1 2 (0,1)20 (1,0)10 (0)15 (1)20 7 2 3 13 (0,0)1 (0,1)2 (0,2)5 (1,0)1 (1,2)8 (2,3)1 (2,4)7 (3,5)2 (3,6)5 (4,2)7 (4,3)5 (4,5)1 (6,0)5 (0)5 (1)2 (3)2 (4)1 (5)4 Sample Output 15 6 Hint The sample input contains two data sets. The first data set encodes a network with 2 nodes, power station 0 with pmax(0)=15 and consumer 1 with cmax(1)=20, and 2 power transport lines with lmax(0,1)=20 and lmax(1,0)=10. The maximum value of Con is 15. The second data set encodes the network from figure 1. */ #include "stdlib.h" #include "stdio.h" /*0 <= n <= 100 (nodes), 0 <= np <= n (power stations), 0 <= nc <= n (consumers), and 0 <= m <= n^2 (power transport lines). */ #define MAX_POWER_NETWORK_TOTAL_NODE_NUMBER 105 #define INFINITE_POWER 0X7FFFFFFF #define min(a,b) (((a) < (b)) ? (a) : (b)) typedef signed char INT8; typedef unsigned char UINT8; typedef signed short INT16; typedef unsigned short UINT16; typedef signed int INT32; typedef unsigned int UINT32; typedef struct _POWER_NETWORK_NODE_ST_ { INT32 iAdjNodeNum; INT32 aiAdjNode[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER]; INT32 iReverseAdjNodeNum; INT32 aiReverseAdjNode[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER]; INT32 iPreNodeIndex;/*for bfs*/ INT32 iMaxFlow;/*for bfs*/ }POWER_NETWORK_NODE_ST; typedef struct _POWER_NETWORK_TRANSPORT_LINE_ST_ { UINT32 uiMaxTransportPowerAmount;/*0 <= z <= 1000*/ UINT32 uiUsedTransportPowerAmount;/*0 <= z <= uiMaxTransportPowerAmount*/ }POWER_NETWORK_TRANSPORT_LINE_ST; typedef struct _POWER_NETWORK_ST_ { INT32 iSrcNodeIndex; INT32 iTgtNodeIndex; INT32 iTotalNodeNum; INT32 iPowerStationNodeNum; INT32 iConsumerNodeNum; INT32 iPowerTransportLineNum; #define NODE_VISITED_COLOR_WHITE 0 #define NODE_VISITED_COLOR_GRAY 1 #define NODE_VISITED_COLOR_BLACK 2 UINT8 aucVistedColor[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER];/*NODE_VISITED_COLOR_WHITE OR NODE_VISITED_COLOR_BLACK*/ POWER_NETWORK_NODE_ST astNode[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER]; POWER_NETWORK_TRANSPORT_LINE_ST astPowerTransportLine[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER][MAX_POWER_NETWORK_TOTAL_NODE_NUMBER]; }POWER_NETWORK_ST; typedef struct _POWER_NETWORK_PATH_ST_ { INT32 iLimitPower; INT32 iNodeNum; INT32 aiNodeIndex[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER]; }POWER_NETWORK_PATH_ST; typedef struct _QUEUE_ST_ { INT32 iHeadIndx; INT32 iTailIndex; INT32 aiNodeIndex[MAX_POWER_NETWORK_TOTAL_NODE_NUMBER]; }QUEUE_ST; QUEUE_ST gstQueue; POWER_NETWORK_ST gstPowerNetwork; POWER_NETWORK_PATH_ST gstPath; void PowerNetworkPrint(void) { INT32 iLoopNode; INT32 iLoopNode1; for(iLoopNode = 0; iLoopNode < gstPowerNetwork.iTotalNodeNum; iLoopNode++) { for(iLoopNode1 = 0; iLoopNode1 < gstPowerNetwork.iTotalNodeNum; iLoopNode1++) { if(gstPowerNetwork.astPowerTransportLine[iLoopNode][iLoopNode1].uiMaxTransportPowerAmount) { printf("(%d,%d):%d/%d/n",iLoopNode,iLoopNode1,gstPowerNetwork.astPowerTransportLine[iLoopNode][iLoopNode1].uiUsedTransportPowerAmount,gstPowerNetwork.astPowerTransportLine[iLoopNode][iLoopNode1].uiMaxTransportPowerAmount); } } } return; } INT32 PowerNetworkInput(void) { INT32 iNodeId_1; INT32 iNodeId_2; INT32 iMaxPowerAmount; INT32 iLoopLine; INT32 iLoopNode; if(EOF == scanf("%d%d%d%d",&gstPowerNetwork.iTotalNodeNum,&gstPowerNetwork.iPowerStationNodeNum,&gstPowerNetwork.iConsumerNodeNum,&gstPowerNetwork.iPowerTransportLineNum )) { return -1; } for(iLoopLine = 0; iLoopLine < gstPowerNetwork.iPowerTransportLineNum; iLoopLine++) { scanf(" (%d,%d)%d",&iNodeId_1,&iNodeId_2, &iMaxPowerAmount); gstPowerNetwork.astPowerTransportLine[iNodeId_1][iNodeId_2].uiMaxTransportPowerAmount += iMaxPowerAmount; if(iNodeId_1 != iNodeId_2) { gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum] = iNodeId_2; gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum++; gstPowerNetwork.astNode[iNodeId_2].aiReverseAdjNode[gstPowerNetwork.astNode[iNodeId_2].iReverseAdjNodeNum] = iNodeId_1; gstPowerNetwork.astNode[iNodeId_2].iReverseAdjNodeNum++; } } gstPowerNetwork.iSrcNodeIndex = MAX_POWER_NETWORK_TOTAL_NODE_NUMBER-2; gstPowerNetwork.iTgtNodeIndex = MAX_POWER_NETWORK_TOTAL_NODE_NUMBER-1; gstPowerNetwork.iTotalNodeNum = MAX_POWER_NETWORK_TOTAL_NODE_NUMBER; for(iLoopNode = 0; iLoopNode < gstPowerNetwork.iPowerStationNodeNum; iLoopNode++) { scanf(" (%d)%d",&iNodeId_1, &iMaxPowerAmount); gstPowerNetwork.astPowerTransportLine[gstPowerNetwork.iSrcNodeIndex][iNodeId_1].uiMaxTransportPowerAmount += iMaxPowerAmount; gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].aiAdjNode[gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].iAdjNodeNum] = iNodeId_1; gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].iAdjNodeNum++; } for(iLoopNode = 0; iLoopNode < gstPowerNetwork.iConsumerNodeNum; iLoopNode++) { scanf(" (%d)%d",&iNodeId_1, &iMaxPowerAmount); gstPowerNetwork.astPowerTransportLine[iNodeId_1][gstPowerNetwork.iTgtNodeIndex].uiMaxTransportPowerAmount += iMaxPowerAmount; gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum] = gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[0] ; gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[0] = gstPowerNetwork.iTgtNodeIndex; gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum++; } return 0; } INT32 PowerNetworkInput_1(void) { INT32 iNodeId_1; INT32 iNodeId_2; INT32 iMaxPowerAmount; INT32 iLoopLine; INT32 iLoopNode; UINT8 aucBuff[128]; if(EOF == scanf("%d%d%d%d",&gstPowerNetwork.iTotalNodeNum,&gstPowerNetwork.iPowerStationNodeNum,&gstPowerNetwork.iConsumerNodeNum,&gstPowerNetwork.iPowerTransportLineNum )) { return -1; } for(iLoopLine = 0; iLoopLine < gstPowerNetwork.iPowerTransportLineNum; iLoopLine++) { scanf("%s", aucBuff); sscanf(aucBuff, "(%d,%d)%d", &iNodeId_1,&iNodeId_2, &iMaxPowerAmount); gstPowerNetwork.astPowerTransportLine[iNodeId_1][iNodeId_2].uiMaxTransportPowerAmount += iMaxPowerAmount; if(iNodeId_1 != iNodeId_2) { gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum] = iNodeId_2; gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum++; gstPowerNetwork.astNode[iNodeId_2].aiReverseAdjNode[gstPowerNetwork.astNode[iNodeId_2].iReverseAdjNodeNum] = iNodeId_1; gstPowerNetwork.astNode[iNodeId_2].iReverseAdjNodeNum++; } } gstPowerNetwork.iSrcNodeIndex = MAX_POWER_NETWORK_TOTAL_NODE_NUMBER-2; gstPowerNetwork.iTgtNodeIndex = MAX_POWER_NETWORK_TOTAL_NODE_NUMBER-1; gstPowerNetwork.iTotalNodeNum = MAX_POWER_NETWORK_TOTAL_NODE_NUMBER; for(iLoopNode = 0; iLoopNode < gstPowerNetwork.iPowerStationNodeNum; iLoopNode++) { scanf("%s", aucBuff); sscanf(aucBuff, "(%d)%d", &iNodeId_1, &iMaxPowerAmount); gstPowerNetwork.astPowerTransportLine[gstPowerNetwork.iSrcNodeIndex][iNodeId_1].uiMaxTransportPowerAmount += iMaxPowerAmount; gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].aiAdjNode[gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].iAdjNodeNum] = iNodeId_1; gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].iAdjNodeNum++; } for(iLoopNode = 0; iLoopNode < gstPowerNetwork.iConsumerNodeNum; iLoopNode++) { scanf("%s", aucBuff); sscanf(aucBuff, "(%d)%d", &iNodeId_1, &iMaxPowerAmount); gstPowerNetwork.astPowerTransportLine[iNodeId_1][gstPowerNetwork.iTgtNodeIndex].uiMaxTransportPowerAmount += iMaxPowerAmount; gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum] = gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[0] ; gstPowerNetwork.astNode[iNodeId_1].aiAdjNode[0] = gstPowerNetwork.iTgtNodeIndex; gstPowerNetwork.astNode[iNodeId_1].iAdjNodeNum++; } return 0; } #define ENQUEUE(viNodeIndex)/ {/ gstQueue.aiNodeIndex[gstQueue.iTailIndex] = viNodeIndex;/ gstQueue.iTailIndex++;/ } #define QUEUE_EMPTY MAX_POWER_NETWORK_TOTAL_NODE_NUMBER #define DEQUEUE(viNodeIndex)/ {/ if(gstQueue.iHeadIndx == gstQueue.iTailIndex )/ {/ viNodeIndex = QUEUE_EMPTY;/ }/ else/ {/ viNodeIndex = gstQueue.aiNodeIndex[gstQueue.iHeadIndx];/ gstQueue.iHeadIndx++;/ }/ } #define CLEAR_QUEUE()/ {/ gstQueue.iHeadIndx = 0;/ gstQueue.iTailIndex = 0;/ } /*return consumed number*/ INT32 BFS_FindPath() { INT32 iAdjNodeIndex; INT32 iNextNodeIndex; INT32 iLoopAdjNode; INT32 iRemainingCapacity; INT32 iLimitPowerTemp = 0; memset(gstPowerNetwork.aucVistedColor,NODE_VISITED_COLOR_WHITE,MAX_POWER_NETWORK_TOTAL_NODE_NUMBER ); //memset(&gstQueue,0,sizeof(QUEUE_ST) ); gstPowerNetwork.aucVistedColor[gstPowerNetwork.iSrcNodeIndex] = NODE_VISITED_COLOR_GRAY; gstPowerNetwork.astNode[gstPowerNetwork.iSrcNodeIndex].iMaxFlow = INFINITE_POWER; CLEAR_QUEUE(); ENQUEUE(gstPowerNetwork.iSrcNodeIndex); while(1) { DEQUEUE(iNextNodeIndex); if(QUEUE_EMPTY == iNextNodeIndex) { break; } for(iLoopAdjNode = 0; iLoopAdjNode < gstPowerNetwork.astNode[iNextNodeIndex].iAdjNodeNum ; iLoopAdjNode++) { iAdjNodeIndex = gstPowerNetwork.astNode[iNextNodeIndex].aiAdjNode[iLoopAdjNode]; iRemainingCapacity = gstPowerNetwork.astPowerTransportLine[iNextNodeIndex][iAdjNodeIndex].uiMaxTransportPowerAmount - gstPowerNetwork.astPowerTransportLine[iNextNodeIndex][iAdjNodeIndex].uiUsedTransportPowerAmount; if(NODE_VISITED_COLOR_WHITE == gstPowerNetwork.aucVistedColor[iAdjNodeIndex] &&0 < iRemainingCapacity) { gstPowerNetwork.aucVistedColor[iAdjNodeIndex] = NODE_VISITED_COLOR_GRAY; gstPowerNetwork.astNode[iAdjNodeIndex].iPreNodeIndex = iNextNodeIndex; gstPowerNetwork.astNode[iAdjNodeIndex].iMaxFlow = min(gstPowerNetwork.astNode[iNextNodeIndex].iMaxFlow ,iRemainingCapacity); if(gstPowerNetwork.iTgtNodeIndex == iAdjNodeIndex) { iLimitPowerTemp = gstPowerNetwork.astNode[iAdjNodeIndex].iMaxFlow ; break; } ENQUEUE(iAdjNodeIndex); } } if(0 < iLimitPowerTemp) { break; } for(iLoopAdjNode = 0; iLoopAdjNode < gstPowerNetwork.astNode[iNextNodeIndex].iReverseAdjNodeNum ; iLoopAdjNode++) { iAdjNodeIndex = gstPowerNetwork.astNode[iNextNodeIndex].aiReverseAdjNode[iLoopAdjNode]; iRemainingCapacity = gstPowerNetwork.astPowerTransportLine[iAdjNodeIndex][iNextNodeIndex].uiUsedTransportPowerAmount; if(NODE_VISITED_COLOR_WHITE == gstPowerNetwork.aucVistedColor[iAdjNodeIndex] &&0 < iRemainingCapacity) { gstPowerNetwork.aucVistedColor[iAdjNodeIndex] = NODE_VISITED_COLOR_GRAY; gstPowerNetwork.astNode[iAdjNodeIndex].iPreNodeIndex = iNextNodeIndex; gstPowerNetwork.astNode[iAdjNodeIndex].iMaxFlow = min(gstPowerNetwork.astNode[iNextNodeIndex].iMaxFlow ,iRemainingCapacity); ENQUEUE(iAdjNodeIndex); } } gstPowerNetwork.aucVistedColor[iNextNodeIndex] = NODE_VISITED_COLOR_BLACK; } gstPath.iLimitPower = iLimitPowerTemp; return iLimitPowerTemp; } /*return consumed number*/ INT32 DFS_FindPath(INT32 viNodeIndex,INT32 viLimitPower) { INT32 iAdjNodeIndex; INT32 iLoopAdjNode; INT32 iRemainingCapacity; INT32 iLimitPowerTemp; if (gstPowerNetwork.iTgtNodeIndex == viNodeIndex ) { gstPath.iLimitPower = viLimitPower; gstPath.iNodeNum = 1; gstPath.aiNodeIndex[0] = viNodeIndex; return viLimitPower; } gstPowerNetwork.aucVistedColor[viNodeIndex] = NODE_VISITED_COLOR_BLACK; for(iLoopAdjNode = 0; iLoopAdjNode < gstPowerNetwork.astNode[viNodeIndex].iAdjNodeNum ; iLoopAdjNode++) { iAdjNodeIndex = gstPowerNetwork.astNode[viNodeIndex].aiAdjNode[iLoopAdjNode]; iRemainingCapacity = gstPowerNetwork.astPowerTransportLine[viNodeIndex][iAdjNodeIndex].uiMaxTransportPowerAmount - gstPowerNetwork.astPowerTransportLine[viNodeIndex][iAdjNodeIndex].uiUsedTransportPowerAmount; if(NODE_VISITED_COLOR_WHITE == gstPowerNetwork.aucVistedColor[iAdjNodeIndex] &&0 < iRemainingCapacity) { iLimitPowerTemp = min(viLimitPower,iRemainingCapacity); if(0 < DFS_FindPath(iAdjNodeIndex,iLimitPowerTemp)) { gstPowerNetwork.aucVistedColor[viNodeIndex] = NODE_VISITED_COLOR_WHITE; gstPath.aiNodeIndex[gstPath.iNodeNum] = viNodeIndex; gstPath.iNodeNum++; return gstPath.iLimitPower; } } } for(iLoopAdjNode = 0; iLoopAdjNode < gstPowerNetwork.astNode[viNodeIndex].iReverseAdjNodeNum ; iLoopAdjNode++) { iAdjNodeIndex = gstPowerNetwork.astNode[viNodeIndex].aiReverseAdjNode[iLoopAdjNode]; iRemainingCapacity = gstPowerNetwork.astPowerTransportLine[iAdjNodeIndex][viNodeIndex].uiUsedTransportPowerAmount; if(NODE_VISITED_COLOR_WHITE == gstPowerNetwork.aucVistedColor[iAdjNodeIndex] &&0 < iRemainingCapacity) { iLimitPowerTemp = min(viLimitPower,iRemainingCapacity); if(0 < DFS_FindPath(iAdjNodeIndex,iLimitPowerTemp)) { gstPowerNetwork.aucVistedColor[viNodeIndex] = NODE_VISITED_COLOR_WHITE; gstPath.aiNodeIndex[gstPath.iNodeNum] = viNodeIndex; gstPath.iNodeNum++; return gstPath.iLimitPower; } } } gstPowerNetwork.aucVistedColor[viNodeIndex] = NODE_VISITED_COLOR_WHITE; return 0; } void UpdatePathCapacity() { INT32 iLoopNode ; INT32 iSrcNodeIndex; INT32 iTgtNodeIndex; for (iLoopNode = gstPath.iNodeNum-1; iLoopNode > 0; iLoopNode--) { iSrcNodeIndex = gstPath.aiNodeIndex[iLoopNode]; iTgtNodeIndex = gstPath.aiNodeIndex[iLoopNode-1]; if (gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiMaxTransportPowerAmount) { gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount += gstPath.iLimitPower; if (gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiMaxTransportPowerAmount) { if (gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount >= gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount ) { gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount/ -= gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount; gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount = 0; } else { gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount/ -= gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount; gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount = 0; } } } else { gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount -= gstPath.iLimitPower; } } return; } void UpdatePathCapacity_ForBfs() { INT32 iNextNodeIndex ; INT32 iSrcNodeIndex; INT32 iTgtNodeIndex; iNextNodeIndex = gstPowerNetwork.iTgtNodeIndex; while(1) { iTgtNodeIndex = iNextNodeIndex; if(iNextNodeIndex == gstPowerNetwork.iSrcNodeIndex ) { break; } iNextNodeIndex = gstPowerNetwork.astNode[iNextNodeIndex].iPreNodeIndex; iSrcNodeIndex = iNextNodeIndex; if (gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiMaxTransportPowerAmount) { gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount += gstPath.iLimitPower; if (gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiMaxTransportPowerAmount) { if (gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount >= gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount ) { gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount/ -= gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount; gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount = 0; } else { gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount/ -= gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount; gstPowerNetwork.astPowerTransportLine[iSrcNodeIndex][iTgtNodeIndex].uiUsedTransportPowerAmount = 0; } } } else { gstPowerNetwork.astPowerTransportLine[iTgtNodeIndex][iSrcNodeIndex].uiUsedTransportPowerAmount -= gstPath.iLimitPower; } } return; } INT32 CaculateMaxConsumedPowerAmount(void) { INT32 iMaxConsumedPower= 0; while(1) { gstPath.iNodeNum = 0; //if(0 >= DFS_FindPath(gstPowerNetwork.iSrcNodeIndex ,INFINITE_POWER)) if(0 >= BFS_FindPath()) { break; } //UpdatePathCapacity(); UpdatePathCapacity_ForBfs(); iMaxConsumedPower += gstPath.iLimitPower; } //PowerNetworkPrint(); return iMaxConsumedPower; } INT32 main(void)// { INT32 iMaxConsumedPower; while (1) { memset(&gstPowerNetwork,0,sizeof(POWER_NETWORK_ST)); //if(-1 == PowerNetworkInput_1()) if(-1 == PowerNetworkInput()) { break; } iMaxConsumedPower = CaculateMaxConsumedPowerAmount(); printf("%d/n",iMaxConsumedPower); } return 0; }