MathJax


Sunday, May 1, 2022

2022-119

Starting from the node indicated as 'start', use DFS and label the nodes with their ending times. Which of the alternatives below corresponds to a possible answer?


Tip: the reverse order of finishing DFS times in a directed acyclic graph is a topological order.





  1. None of the above.

Original idea by: Filipe Maciel Roberto

No comments:

Post a Comment

2026-346

Consider a "Feasibility Matrix" \(M\) for all \(n, m \geq 1\), where an entry \(M_{n,m}\) is equal to 1 if a planar layout for the...