Created
October 7, 2021 16:48
-
-
Save mustafa-qamaruddin/e39d1bffde3f53b3264f712b274393e4 to your computer and use it in GitHub Desktop.
NA
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.ArrayDeque; | |
import java.util.ArrayList; | |
import java.util.Deque; | |
import java.util.List; | |
import java.util.Stack; | |
class Traverse { | |
int[][] graph; | |
boolean[] visited; | |
List<List<Integer>> retPaths; | |
int noop = -1; | |
public Traverse(int[][] graph) { | |
this.graph = graph; | |
retPaths = new ArrayList<>(); | |
reset(); | |
} | |
void reset() { | |
visited = new boolean[graph.length]; | |
for (int i = 0; i < visited.length; i++) { | |
visited[i] = false; | |
} | |
} | |
List<Integer> dfs(int node) { | |
List<Integer> ret = new ArrayList<>(); | |
Stack<Integer> stack = new Stack<>(); | |
Deque<Integer> q = new ArrayDeque<>(); | |
stack.push(node); | |
while (!stack.empty()) { | |
int currNode = stack.pop(); | |
visited[currNode] = true; | |
q.addFirst(currNode); | |
for (int i = 0; i < graph[currNode].length; i++) { | |
if (!visited[graph[currNode][i]]) { | |
stack.push(graph[currNode][i]); | |
} | |
} | |
} | |
return new ArrayList<>(q); | |
} | |
List<List<Integer>> findDependencies() { | |
for (int i = 0; i < graph.length; i++) { | |
reset(); | |
var path = dfs(i); | |
retPaths.add(path); | |
} | |
return retPaths; | |
} | |
} | |
public class TaskDep { | |
public static void main(String[] args) { | |
int[][] adjLs = { | |
{1, 3}, // 0 | |
{2}, // 1 | |
{}, // 2 | |
{}, // 3 | |
{2, 3}, // 4 | |
}; | |
var g = new Traverse(adjLs); | |
List<List<Integer>> deps = g.findDependencies(); | |
for (int i = 0; i < deps.size(); i++) { | |
System.out.println(i + ": " + deps.get(i)); | |
} | |
} | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment