题目68：连通图

//http://ac.jobdu.com/problem.php?cid=1040&pid=67

#include <stdio.h>
int Tree[1001];
int findRoot(int x)
{
	if (Tree[x]==-1)
	{
		return x;
	}
	else
	{
		int tmp=findRoot(Tree[x]);
		Tree[x]=tmp;
		return tmp;
	}
}

int main()
{
	int n,m,i;
	while (scanf("%d%d",&n,&m)!=EOF && n!=0 &&m!=0)
	{
		int a,b;
		for (i=1;i<=n;i++)
		{
			Tree[i]=-1;
		}
		while (m--)
		{
			
			scanf("%d%d",&a,&b);
			a=findRoot(a);
			b=findRoot(b);
			if (a!=b)
			{
				Tree[a]=b;
			}
		}
		int ans=0;
		for (i=1;i<=n;i++)
		{
           if (Tree[i]==-1)
           {
			   ans++;
           }
		}
		if (ans>1)
		{
			printf("NO\n");
		}
		else
			printf("YES\n");

	}
}