## 题目

Given a directed, acyclic graph of `N`

nodes. Find all possible paths from node `0`

to node `N-1`

, and return them in any order.

The graph is given as follows: the nodes are 0, 1, …, graph.length - 1. graph[i] is a list of all nodes j for which the edge (i, j) exists.

1 | Example: |

**Note:**

- The number of nodes in the graph will be in the range
`[2, 15]`

. - You can print different paths in any order, but you should keep the order of nodes inside one path.

## 思路

DFS.

## 代码

1 | class Solution(object): |