题目链接: 有向图的完全可达性
本题对有向图进行遍历,并标记遍历经过的节点即可,最后查看节点是否完全标记。深度优先搜索和广度优先搜索均可。
#include <bits/stdc++.h>
using namespace std;
void dfs(vector<vector<int>>& graph, vector<bool>& visited, int cur){
if(visited[cur] == true){
return;
}
visited[cur] = true;
for(int i = 1; i < graph[cur].size(); i++){
if(graph[cur][i] == 1){
dfs(graph, visited, i);
}
}
}
void bfs(vector<vector<int>>& graph, vector<bool>& visited, int cur){
visited[cur] = true;
queue<int> que;
que.push(cur);
while(!que.empty()){
int tmp = que.front();
que.pop();
for(int i = 1; i < graph[tmp].size(); i++){
if(graph[tmp][i] == 1 && !visited[i]){
visited[i] = true;
que.push(i);
}
}
}
}
int main(){
int n, k, s, t;
cin >> n >> k;
vector<vector<int>> graph(n + 1, vector<int>(n + 1, 0));
while(k--){
cin >> s >> t;
graph[s][t] = 1;
}
vector<bool> visited(n + 1, false);
// dfs(graph, visited, 1);
bfs(graph, visited, 1);
for(int i = 1; i <= n; i++){
if(visited[i] == 0){
cout << -1 << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}