CriticalPath

数据结构图的代码#include <iostream> #include <cstring> #include <queue> int defaultNumVertices = 100; int defaultWeight=0; int maxWeight=0x7fffffff; using namespace std; template<typename W> struct EdgeNode { int to; W weight; EdgeNode<W>* next; EdgeNode(int t,const W& w, EdgeNode<W>* nt=NULL):to(t),weight(w),next(nt) { } EdgeNode(EdgeNode<W>* nt=NULL):next(nt) { } };