Home/ Questions/Q 9185589
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-17T19:18:53+00:00

Given the following graph : What algorithm can I use to output topological ordered

  • 0

Given the following graph:

enter image description here

What algorithm can I use to output topological ordered lists with tasks to complete, and that are relevant for just for a specific node?

For example, considering the node 2, the list should be:

7, 5, 11, 2

or

5, 7, 11, 2
Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team
    1. Reverse the edges
    2. Run a DFS starting from 2
    3. Upon leaving a node, insert it into the list.

    Example:

    Enter 2
  Enter 11
    Enter 7
    Leave 7, insert into list
    Enter 5
    Leave 5, insert into list
  Leave 11, insert into list
Done, insert 2 into list

Result: 7, 5, 11, 2
    • 0