1.

__________algorithm will compute shortest paths from a single node to all other nodes.

A. Betweenness
B. Brandes’
C. Dijkstra’s
D. None of these
Answer» D. None of these


Discussion

No Comment Found