MathJax


Wednesday, August 21, 2024

2024-231

How does a Depth-First Search (DFS) provide a topological sort ?


A) Sorting nodes by finishing time, in ascending order

B) Selecting nodes in a random order

C) Visiting nodes in alphabetical order

D) Sorting nodes by finishing time, in descending order

E) None of the above


Original idea by: Cinthia Kleiner

No comments:

Post a Comment

2025-264

  Observing the images below: Mark the option that matches the node shapes in the Scale-Free network with the data point shapes in the Log-l...