边割集

同点割集没有什么区别，明白了点割集，这个就好办了

# include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100;
int num[N], flag[N], low[N], V, E, index = 0, e[N][N];

void dfs(int cur, int father) {
    index++;
    num[cur] = index;
    low[cur] = index;
    for (int i = 1; i <= V; i++) {
        if (e[cur][i] == 1)
            if (num[i] == 0) {
                dfs(i, cur);
                low[cur] = min(low[cur], low[i]);
                if (low[i] > low[cur])
                    printf("%d - %d 
", cur, i);
            }
            else if (i != father)
                low[cur] = min(low[cur], num[i]);
    }
}