1.冗余连接1
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> father(1001,0);
void init(){
for(int i = 0; i < n; i++){
father[i] = i;
}
}
int find(int u){
if(father[u] == u){
return u;
}else{
return find(father[u]);
}
}
bool isSame(int u, int v){
u = find(u);
v = find(v);
return u == v;
}
void join(int u, int v){
u = find(u);
v = find(v);
if(u == v) return;
father[v] = u;
}
int main(){
int s,t;
cin >> n;
init();
for(int i = 0; i < n; i++){
cin >> s >> t;
if(isSame(s,t)){
cout << s <<" "<< t;
return 0;
}else{
join(s,t);
}
}
}
思路:成为树的条件是我们找到有向图的环,然后删掉其中一条就好了。
判断是否是环的条件就是用并查集理论,如果我们往里面添加边时,发现这条边的两个结点已经在集合里,说明此条边就是我们要删除的边。
2.冗余连接2
代码:
#include <iostream>
#include <vector>
using namespace std;
int n; // 结点数
vector<int> father(1001,0);
void init(){
for(int i = 1; i <= n; i++){
father[i] = i;
}
}
int find(int u){
if(father[u] == u){
return u;
}else{
return find(father[u]);
}
}
bool isSame(int u,int v){
u = find(u);
v = find(v);
return u == v;
}
void join(int u, int v){
u = find(u);
v = find(v);
if(u == v) return;
father[v] = u;
}
void getRemoveEdge(const vector<vector<int>>& edges){
init();
for(int i = 0; i < n; i++){
if(isSame(edges[i][0],edges[i][1])){
cout << edges[i][0] << " " << edges[i][1];
return;
}else{
join(edges[i][0],edges[i][1]);
}
}
}
// 删了一条边后是不是树
bool isTreeAfterRemoveEdge(const vector<vector<int>>& edges,int deleteEdge){
init();
for(int i = 0; i < n; i++){
if(i == deleteEdge) continue;
if(isSame(edges[i][0],edges[i][1])){
return false;
}
join(edges[i][0],edges[i][1]);
}
return true;
}
int main(){
int s,t;
vector<vector<int>> edges;
cin >> n;
vector<int> inDegree(n + 1,0); // 记录结点入度
for(int i = 0; i < n; i++){
cin >> s >> t;
inDegree[t]++;
edges.push_back({s,t});
}
vector<int> vec; // j记录入度为2的边
for(int i = n - 1; i > 0; i--){
if(inDegree[edges[i][1]] == 2){
vec.push_back(i);
}
}
// 如果有结点入度为2
if(vec.size() > 0){
if(isTreeAfterRemoveEdge(edges,vec[0])){
cout << edges[vec[0]][0] << " "<< edges[vec[0]][1];
}else{
cout << edges[vec[1]][0] << " " << edges[vec[1]][1];
}
return 0;
}
// 如果没有找到结点入度为2
getRemoveEdge(edges);
}
思路: