UVA 539

/*好长时间没有A题了，写个简单搜索连memset( map, 0, sizeof(map) )都忘了，TLE了2次...唉...*/
#include <stdio.h>
#include <string.h>
#define MAX 100
int map[MAX][MAX], max;
int vis[MAX][MAX];
int node, elem;
void dfs( int n, int cal )
{
	int i;
	for( i = 0; i < node; i++ )
	{
		if( map[n][i] && !vis[n][i] )
		{
			vis[n][i] = vis[i][n] = 1;
			dfs( i, cal+1 );
			vis[n][i] = vis[i][n] = 0;
		}
	}
	if( cal > max )
		max = cal;
}
int main()
{
	int i, u, v;
	while( scanf( "%d %d", &node, &elem ) && node && elem )
	{
		memset( map, 0, sizeof(map) );
		for( i = 0; i < elem; i++ )
		{
			scanf( "%d %d", &u, &v );
			map[u][v] = map[v][u] = 1;
		}
		max = -1;
		for( i = 0; i < node; i++ )
		{
			memset( vis, 0, sizeof(vis) );
			dfs( i, 0 );
		}
		printf( "%d\n", max );
	}
	return 0;
}