What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in form of adjacency list and binary heap is used −

What will be the running-time of Dijkstra's single source shortest pat

1.	What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in form of adjacency list and binary heap is used −
A.	Ο(\|V\|2)
B.	Ο(\|V\| log \|V\|)
C.	Ο(\|E\|+\|V\| log \|V\|)
D.	None of these
Answer» D. None of these