对于给定的有向图,先进行拓扑处理,然后求出最长路径。
//寻找图的关键路径
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
//最大边数,最大点数
const int Max_M=100100;
const int Max_N=50100;
struct Graph
{
int nodeNumber,Link[Max_N],number;
struct node
{
int vertex,weight,next;
} edge[Max_M];
void initGraph(int n=0)
{
number=n;
nodeNumber=0;
memset(Link,-1,sizeof(Link));
}
void addEdge(int vertex_x,int vertex_y,int weight)
{
edge[nodeNumber].vertex = vertex_y;
edge[nodeNumber].weight = weight;
edge[nodeNumber].next = Link[vertex_x];
Link[vertex_x] = nodeNumber;
nodeNumber++;
}
void eraseLink(int vertex)
{
Link[vertex] = -1;
}
} ;
// 求图的拓扑序
int topoOrder[Max_N],inDegree[Max_N];
bool topo(Graph &G, int *topoOrder)
{
memset(inDe