摘要：
#include#include#include#include#includeusing namespace std;const double esp = 1e-8;#define Fact(x) ((x)*(x))//一般图匹配带花树const int MaxN = 111;int N;bool Graph[MaxN][MaxN];int Match[MaxN];bool InQueue[MaxN], InPath[MaxN], InBlossom[MaxN];int Head, Tail;int Queue[MaxN];int Start, Finish;int NewBase;int 阅读全文
