算法导论 最大流 前置重贴标签法

#include <stdio.h>  
#include <stdlib.h>  
#include <limits.h>  
  
//图节点

typedef struct AdjacentNodeType
{
	int index;
	struct AdjacentNodeType *nextNeighbor;
}AdjacentNode,*pAdjacentNode;

typedef struct VertexNode    
{    
	int index;
    char name;  
    int h;  
    int e;  
	pAdjacentNode current;
	pAdjacentNode head;
	struct VertexNode *next;
	struct VertexNode *pre;
}Vertex,*pVertex;    
    
//图    
typedef struct     
{    
    int vn;    
    int **E;  //容量C作为边矩阵的值  
    pVertex *V;    
    int **f; //流值  
    int **rE; // 残留边
	pVertex L; //前置重贴标签用到的链表，在initGraph()中初始化
}Graph,*pGraph;    

void generateAdjacentList(pGraph g,int s,int t)
{
	for(int i=0;i<g->vn;i++)
	{
		for(int j=0;j<g->vn;j++)
		{
			if(g->E[i][j]>0 || g->E[j][i]>0)
			{			
				pAdjacentNode adj=(pAdjacentNode)malloc(sizeof(AdjacentNode));
				adj->index=j;
				adj->nextNeighbor=g->V[i]->head;
				g->V[i]->head=adj;
			}			
		}
	}
}

//根据算法导论 图26-6初始化图 
pGraph initGraph()    
{    
    pGraph g=(pGraph)malloc(sizeof(Graph));    
    g->vn=6; 
	int s=0,t=g->vn-1;
    pVertex vs=(pVertex)malloc(sizeof(Vertex));    
    vs->name='s';
	vs->index=0;
    pVertex v1=(pVertex)malloc(sizeof(Vertex));    
    v1->name='1'; 
	v1->index=1;
    pVertex v2=(pVertex)malloc(sizeof(Vertex));    
    v2->name='2';
	v2->index=2;
    pVertex v3=(pVertex)malloc(sizeof(Vertex));    
    v3->name='3';
	v3->index&#