#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <limits.h>
#include <map>
#include <stack>
#include <algorithm>

using namespace std;

int dfs(vector<vector<int>>& g, vector<int>& state, int node)
{
	int i, longest = 1, current;
	for (i = 0; i < g[node].size(); i++)
	{
		if (state[g[node][i]] == -2)
		{
			continue;
		}
		if (state[node] - state[g[node][i]] > longest)
		{
			longest = state[node] - state[g[node][i]];
			continue;
		}
		if (state[g[node][i]] == INT_MAX)
		{
			state[g[node][i]] = state[node] + 1;
			current = dfs(g, state, g[node][i]);
		}
	}

	state[node] = -2;
	return max(current, longest);
}

int main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, m, i, temp1, temp2;
	cin >> n >> m;

	vector<vector<int>> g(n);

	for (i = 0; i < m; i++)
	{
		cin >> temp1 >> temp2;

		g[--temp1].push_back(--temp2);
		g[temp2].push_back(temp1);
	}

	vector<int> state(n, INT_MAX);
	state[0] = 0;

	cout << dfs(g, state, 0) + 1;
}