0 votes
130 views
in Programming Languages & Algorithms by (user.guest)

1 Answer

0 votes
by (user.guest)
 
Best answer

The data structure to be used to implement Dijkstra's shortest path algorithm on unweighted graphs so that it runs in linear time is a Queue.


Related questions

+1 vote
1 answer 174 views
+1 vote
1 answer 163 views
0 votes
1 answer 264 views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...