DFS-递归与回溯之The Settlers of Catan

题目：

Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilderness.
You are employed by a software company that just has decided to develop a computer version of this game, and you are chosen to implement one of the game’s special rules:

When the game ends, the player who built the longest road gains two extra victory points.
The problem here is that the players usually build complex road networks and not just one linear path. Therefore, determining the longest road is not trivial (although human players usually see it immediately).
Compared to the original game, we will solve a simplified problem here: You are given a set of nodes (cities) and a set of edges (road segments) of length 1 connecting the nodes.
The longest road is defined as the longest path within the network that doesn’t use an edge twice. Nodes may be visited more than once, though.

Example: The following network contains a road of length 12.

o o–o o

\ / \ /

o–o o–o

/ \ / \

o o–o o–o

输入：

The input will contain one or more test cases.
The first line of each test case contains two integers: the number of nodes n (2<=n<=25) and the number of edges m (1<=m<=25). The next m lines describe the m edges. Each edge is given by the numbers of the two nodes connected by it. Nodes are numbered from 0 to n-1. Edges are undirected. Nodes have degrees of three or less. The network is not neccessarily connected.
Input will be terminated by two values of 0 for n and m.

输出：

For each test case, print the length of the longest road on a single line.

输入样例：

3 2
0 1
1 2
15 16
0 2
1 2
2 3
3 4
3 5
4 6
5 7
6 8
7 8
7 9
8 10
9 11
10 12
11 12
10 13
12 14
0 0

输出样例：

2
12

题解题意及注释代码：

这道题，就是要把输入的点连接起来，求最长的能连成多长的边，一道典型的dfs，对每个点都用dfs遍历一次，然后用max求出最大的边长。

#include<bits/stdc++.h>
using namespace std;
const int maxn=100;
int n,m,ans;
int fmap[maxn][maxn];//记录点到点是否连通 连通标记为1；
int vis[maxn][maxn];
void dfs(int u,int len){//u进入的点，len走过的长度
    ans=max(ans,len); 
	for(int i=0;i<n;i++){
		if(fmap[u][i]==0||vis[u][i]==1) continue;//如果该条边走过或者被挑选过直接跳过
		vis[u][i]=vis[i][u]=1;//挑选的这条边标记为走过
		dfs(i,len+1);//找这条边以后的点 
		vis[u][i]=vis[i][u]=0; //将挑选过的边标记为没走过 便于回溯再次查找其他路径时刷新路没走过 
	}
} 
int main(){
	while(~scanf("%d%d",&n,&m)){
		if(n==0||m==0) break;
		memset(fmap,0,sizeof(fmap));
		for(int i=1;i<=m;i++){
			int l,r;
			scanf("%d%d",&l,&r);
			fmap[l][r]=fmap[r][l]=1;
		}
		ans=0;
		for(int i=0;i<n;i++){
			memset(vis,0,sizeof(vis));
			dfs(i,0);//把每个点都当作起点走一趟，找到最大的边数 
		}
		printf("%d\n",ans); 
	}
	return 0;
}