E - Transitivity (atcoder.jp)
#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b;i ++ )
#define fd(i,a,b) for(int i=a;i>=b;i -- )
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef vector<vector<LL>> VVL;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e6+ 10,M = N * 4,INF = 0x3f3f3f3f ;
const int mod = 1e9;
const double eps = 1e-8;
int n,m;
inline void solve()
{
cin >> n >> m ;
vector<int> g[n];
while(m -- )
{
int a,b;cin >> a >> b;
a--,b--;
g[a].pb(b);
g[b].pb(a);
}
vector<bool> st(n);
fu(i,0,n-1) // 每次判断每个子图中点数和边数是否相等
{
if(st[i]) continue;
queue<int> q;q.push(i);
st[i] = 1;
int v=0,e=0;
// 点数 边数
while(q.size())
{
int t = q.front();q.pop();
v ++ ; e += g[t].size();
for(auto x : g[t])// 枚举当前点能到的点
if(!st[x])// 如果当前点之前没有被遍历过的话
{
st[x] = 1; q.push(x);
}
}
e /= 2 ; // 一条边的作用效果之前加了两次
if(v != e)
{
cout <<"No\n";
return ;
}
}
cout << "Yes\n";
}
signed main()
{
// freopen("1.txt","w",stdout);
ios
int t=1;
// cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}