GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes
Let G(V, E) an undirected graph with positive edge weights. Dijkstra's single-source shortest path algorithm can be implemented using the binary heap data structure with time complexity:
asked in Graph search, minimum spanning trees, shortest paths by gate

1 Answer

0 votes

O ((| E | + | V |) log | V |)

answered by gate

Related questions

The best answer to any question