While topological sorting primarily applies to directed acyclic graphs (DAGs), certain algorithms can handle graphs with _______ edges by modifying the approach.

  • Bidirectional
  • Cyclic
  • Undirected
  • Weighted
While topological sorting primarily applies to directed acyclic graphs (DAGs), certain algorithms can handle graphs with cyclic edges by modifying the approach. Handling cycles requires additional considerations and modifications to traditional topological sorting algorithms.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *