#include#include#includeusing namespace std;int vis[5000];vector map[5000];int ans;void dfs(int k,int num){ vis[k]=num; //相当于给每个结点编号 for(int i=0;i2&&tmp>ans) ans=tmp; } }}int main(){ int n,m,a,b,c; int cas; scanf(%d,&cas); while(cas--) { ans=0; scanf(%d%d,&n,&m); for(int i=1;i<=n;i++) { map[i].clear(); } for(int i=1;i<=m;i++) { scanf(%d%d,&a,&b); map[a].push_back(b); map[b].push_back(a); } memset(vis,0,sizeof(vis)); for(int i=1;i<=n;i++) { if(!vis[i]); dfs(i,0); } printf(%d\n,ans); } return 0;}
http://www.bkjia.com/phpjc/477210.htmlwww.bkjia.comtruehttp://www.bkjia.com/phpjc/477210.htmltecharticle#includecstdio#includecstring#includevectorusing namespace std;int vis[5000];vectorint map[5000];int ans;void dfs(int k,int num){ vis[k]=num; //相当于给每个结点编号 for(i...