πŸ“Š High Performance Computing
Q. When the topological sort of a graph is unique?
  • (A) when there exists a hamiltonian path in the graph
  • (B) in the presence of multiple nodes with indegree 0
  • (C) in the presence of single node with indegree 0
  • (D) in the presence of single node with outdegree 0
πŸ’¬ Discuss
βœ… Correct Answer: (A) when there exists a hamiltonian path in the graph

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
813
Total Visits
πŸ“½οΈ
2 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
89%
Success Rate