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

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2024-241

Consider a particle moving in a one dimensional space. Its acceleration is proportional to the square of its velocity. Also, at \( t=0 \), i...

  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2023-228
    A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...
  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...