Dijkstra

Consider the routing protocols given in List I and the names given in List II: List I (i) Distance vector routing (ii) Link state routing List II (a) Bellman-Ford (b) Dijkstra For...

Which of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?

To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:

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 compl...

An unrestricted use of the "goto" statement is harmful because of which of the following reason(s):