首页 > 代码库 > CC150 4.2
CC150 4.2
4.2 Given a directed graph, design an algorithm to find out whether there is a route between two nodes.
Node { List<Node> neighbours; } boolean isConnected(Node from, Node to) { Stack<Node> toVisit = initStack(); Set<Node> seen = initSet(); toVisit.push(from); while (!toVisit.isEmpty()) { Node n = toVisit.pop(); if (n == to) return true; while (Node neighbour : n.neighbours) { if (!seen.contains(neighbour)) { seen.add(neighbour); toVisit.add(neighbour); } } } return false; }
CC150 4.2
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。