#176 Route Between Two Nodes in Graph

本文介绍了一种使用广度优先搜索(BFS)算法来判断有向图中两个节点间是否存在路径的方法,并提供了一个具体的代码实现案例。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目描述:

Given a directed graph, design an algorithm to find out whether there is a route between two nodes.

Example

Given graph:

A----->B----->C
 \     |
  \    |
   \   |
    \  v
     ->D----->E

for s = B and t = E, return true

for s = D and t = C, return false

题目思路:

这题我发现只能用bfs做,dfs做会超时(坑爹呀!)。bfs用简单的传统算法就好了。

Mycode(AC = 396ms):

/**
 * Definition for Directed graph.
 * struct DirectedGraphNode {
 *     int label;
 *     vector<DirectedGraphNode *> neighbors;
 *     DirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    /**
     * @param graph: A list of Directed graph node
     * @param s: the starting Directed graph node
     * @param t: the terminal Directed graph node
     * @return: a boolean value
     */
    bool hasRoute(vector<DirectedGraphNode*> graph,
                  DirectedGraphNode* s, DirectedGraphNode* t) {
        // write your code here
        stack<DirectedGraphNode *> sgraph;
        sgraph.push(s);
        
        // bfs to search the neighbors
        while (!sgraph.empty()) {
            DirectedGraphNode *node = sgraph.top();
            sgraph.pop();
            
            if (node->label == t->label) return true;
            
            for (int i = 0; i < node->neighbors.size(); i++) {
                sgraph.push(node->neighbors[i]);
            }
        }
        
        return false;
    }
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值