04.01. Route Between Nodes

中文文档

Description

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

Example1:

 Input: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2

 Output: true

Example2:

 Input: n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4

 Output true

Note:

1. 0 <= n <= 100000
2. All node numbers are within the range [0, n].
3. There might be self cycles and duplicated edges.

Solutions

Python3

Java

...