get all possible topological sort of an directed graph

前端 未结 0 1282
刺人心
刺人心 2021-01-13 06:44

I have below directed graph

graph = { 1: [3, 2], 2: [4, 3], 3: [4], 4: [6, 5], 5: [1, 6] }

in such a way that,

1 reaches to 3 and 2

相关标签:
回答
  • 消灭零回复
提交回复
热议问题