## Discussion Forum

Que. | 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:Ο(|E|+|V| log |V|) |