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.
Example:
Input: [[1,2], [3], [3], []]
Output: [[0,1,3],[0,2,3]]
Explanation: The graph looks like this:
0--->1
| |
v v
2--->3
There are two paths: 0 -> 1 -> 3 and 0 -> 2 -> 3.
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.
题目看了半天才看懂,大意就是:
给出了一个有向无环图,求从起点到终点的所有路径。图的表示方法是,共有n个节点,其数字分别为0…n-1,给出的图graph的每个位置对应的是第i个节点能到达的下一个节点的序号位置。比如题中graph[0] = [1,2]表示图的起点0指向了1,2两个节点。
思路是利用DFS算法
class Solution {
public:
bool getAllPath(vector<vector<int>>& graph,int node,vector<vector<int>> &ret,vector<int> &path){
/*the last node*/
if(node == graph.size()-1){
ret.push_back(path);
return true;
}
/*push the first node*/
for(int i = 0;i < graph[node].size();++i){
path.push_back(graph[node][i]);
getAllPath(graph,graph[node][i],ret,path);
path.pop_back();
}
return true;
}
vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
stack<int> s;
int n = graph.size();
vector<vector<int>> ret;
vector<int> path;
if(graph.size() <= 0){
return ret;
}
path.push_back(0);
getAllPath(graph,0,ret,path);
return ret;
}
};