# Route Between Two Nodes in Graph

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

Example

```
A----->B----->C
\ |
\ |
\ |
\ v
->D----->E
B to E: true
D to C: false
```

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

Example

```
A----->B----->C
\ |
\ |
\ |
\ v
->D----->E
B to E: true
D to C: false
```