Q. __________algorithm will compute shortest paths from a single node to all other nodes. (Solved)

1. Betweenness

2. Brandes’

3. Dijkstra’s

4. None of these

  • c. Dijkstra’s

Related Topics

Subscribe Now

Get All Updates & News