Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)

  1. Home

Question:Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)

1.O(V + E)

2.O(V)

3.O(E)

4.O(V*E)

Posted by R4R Team
  1. Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!