Improve company productivity with a Business Account.Sign Up

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 274
  • Last Modified:

Is it possible to make Dijkstra's algorithm faster??

I heard of using multiheap,but how does it exactly work?
also,how do we ditch the heap,thanks experts
0
shingo43
Asked:
shingo43
2 Solutions
 
shingo43Author Commented:
I still do not understand,can we use a Queue instead of a Heap?how and how fast will it run,thanks
0
 
nafis_devlprCommented:
look their is a definite difference between queues and priority ques(Heap). A que which use the lifo(last in first out) method straight forward, but the heap actually use a criteria to which will go first and which will go later. For a max heap, the higer values will go first and the lower later, vice-versa for min heap.

So its not the matter of speed but criteria.

Nafis
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now