摘要： 代码：#include<iostream>#include<fstream>#include<queue>using namespace std;struct e{ int data; int cost; e *next;};e edge[25];int n,m;int r[25],num[25];void add(int s,int t,int w){ e *p=new e; p->data=t; p->cost=w; p->next=edge[s].next; edge[s].next=p;}int v[25];int ans;int 阅读全文

摘要： 代码:#include<iostream>#include<fstream>using namespace std;struct e{ int data; e *next;};e edge[1001];void add(int i,int j){ e *p=new e; p->data=j; p->next=edge[i].next; edge[i].next=p; e *q=new e; q->data=i; q->next=edge[j].next; edge[j].next=q;}int dfn[1001],v[1001],low[1001 阅读全文

摘要： 代码：#include<iostream>#include<fstream>#include<cmath>using namespace std;int n;struct e{ int data; e *next;};e edge[101];int v[101];void add(int s,int t){ e *p=new e; p->data=t; p->next=edge[s].next; edge[s].next=p;}int x[101],y[101],mark[101][101];int dfs(int s,int kind,int 阅读全文