Is it possible to solve this using DFS?

[Denis1]

Hi guys just wondering if anyone has solved this using DFS ?

[Gaurav7]

It’s possible.

With modification with this https://www.geeksforgeeks.org/find-paths-given-source-destination/?

What do you think?

[Nicole]

It’s actually BFS fashion because of using recursive call.

[Akshay_Goel]

Slightly More Concise DFS Solution with Backtracking [Python]

def print_orders(tasks, prerequisites): degreemap, adjlist = {}, {} for t in range(tasks): degreemap[t] = 0 adjlist[t] = [] for (v1, v2) in prerequisites: adjlist[v1].append(v2) degreemap[v2] += 1 all_schedules = [] def dfs(path): if len(path) == tasks: all_schedules.append(path.copy()) next_sources = ( t for t in range(tasks) if degreemap[t] == 0 ) # determine active sources (i.e …

Just shared my approach with clear DFS!