1900分图论：0-1MST 计算补图的最大联通块个数

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 200005;
int n , m;
set <int> edge[N];
set <int> ve;
int vis[N];
void dfs(int x)
{
    vis[x] = 1;
    ve.erase(x);
    vector <int> q;
    for (auto v : ve)
    {
        if(edge[x].find(v) == edge[x].end())
            q.pb(v);
    }
    for (auto v : q)
        ve.erase(v);
    for (auto v : q)
        dfs(v);
}
int main(void)
{
    CLOSE;
    cin >> n >> m;
    for (int i = 1 ; i <= m ; i ++)
    {
        int u , v ;
        cin >> u >> v;
        edge[u].insert(v);
        edge[v].insert(u);
    }
    int ans = 0;
    for (int i = 1 ; i <= n ; i ++)
        ve.insert(i);
    for (int i = 1 ; i <= n ; i ++)
    {
        if(!vis[i])
        {
            ans += 1;
            dfs(i);
        }
    }
    cout << ans - 1<<endl;
}