An Algorithms and Data Structure repository containing implementation of various basic and advanced DS,with some competitive programming questions based on them.
2
stars
0
forks
source link
Issue with Lazy Implementation of Dijkstra Algorithm #1
Graph class as well as a seperate file in the repository uses a naive approach for implementing Dijkstra Algorithm(it takes O(N) time to get the node with minimum distance at every point). Lazy implementation needed (use of priority queue to get the minimum vertex at every iteration of outer loop)
Graph class as well as a seperate file in the repository uses a naive approach for implementing Dijkstra Algorithm(it takes O(N) time to get the node with minimum distance at every point). Lazy implementation needed (use of priority queue to get the minimum vertex at every iteration of outer loop)