题目链接:https://leetcode.cn/problems/route-between-nodes-lcci/
题目如下:
class Solution {
public:
bool findWhetherExistsPath(int n, vector<vector<int>>& graph, int start, int target) {
//存储图的各条边
unordered_map<int,vector<int>> umap;
for(auto e:graph){
umap[e[0]].push_back(e[1]);
}
//bfs,将起始节点放入队列,依次,获得所有以此为起点的终节点
queue<int> que;
que.push(start);
while(que.size()){
auto t=que.front();
que.pop();
for(auto e:umap[t]){
que.push(e);
if(e==target) return true;
}
}
return false;
}
};