If we modify Dijkstra algorithm from "single source to all nodes shortest path" to find the shortest path from "single source to a single destination point", then what will be the difference between this modified Dijkstra and uniform cost search? Any help will be appreciated. Thanks.
What's the difference between Modified Dijkstra with single source, single destination point and Uniform Cost Search?
1.5k views Asked by Ayesha At
2
There are 2 answers
1
GolamMazid Sajib
On
There is no difference. If you use dijkstra, When you start from single source there will be calculated shortest path for all node. You visit from source node to connected node. Then next node is shortest cost node from priority queue. Before insert new node in priority queue, check current node cost and new cost. If new cost is less than node cost then insert this node in priority queue.
Look at this to get how to calculate single source to all node.
Related Questions in ALGORITHM
- MODx Create dynamic frontend page / display manager page without login
- How to get a list of all user groups in Modx Revolution
- Cant get Google map working
- Send Mail from MODx Template
- how to use conditional output filter for date field
- Proper way to perform AJAX request from MODx CMP (Custom Manager Page)
- MODx second runProcessor returns response of the first one
- Group 'input option values' in template variable with 'listbox' type
- Why is Modx Cloud turning my links to the cloud address whenever I preview a page?
- .htaccesss RewriteRule won't work
Related Questions in COMPARISON
- MODx Create dynamic frontend page / display manager page without login
- How to get a list of all user groups in Modx Revolution
- Cant get Google map working
- Send Mail from MODx Template
- how to use conditional output filter for date field
- Proper way to perform AJAX request from MODx CMP (Custom Manager Page)
- MODx second runProcessor returns response of the first one
- Group 'input option values' in template variable with 'listbox' type
- Why is Modx Cloud turning my links to the cloud address whenever I preview a page?
- .htaccesss RewriteRule won't work
Related Questions in UPDATES
- MODx Create dynamic frontend page / display manager page without login
- How to get a list of all user groups in Modx Revolution
- Cant get Google map working
- Send Mail from MODx Template
- how to use conditional output filter for date field
- Proper way to perform AJAX request from MODx CMP (Custom Manager Page)
- MODx second runProcessor returns response of the first one
- Group 'input option values' in template variable with 'listbox' type
- Why is Modx Cloud turning my links to the cloud address whenever I preview a page?
- .htaccesss RewriteRule won't work
Related Questions in DIJKSTRA
- MODx Create dynamic frontend page / display manager page without login
- How to get a list of all user groups in Modx Revolution
- Cant get Google map working
- Send Mail from MODx Template
- how to use conditional output filter for date field
- Proper way to perform AJAX request from MODx CMP (Custom Manager Page)
- MODx second runProcessor returns response of the first one
- Group 'input option values' in template variable with 'listbox' type
- Why is Modx Cloud turning my links to the cloud address whenever I preview a page?
- .htaccesss RewriteRule won't work
Related Questions in UCS
- MODx Create dynamic frontend page / display manager page without login
- How to get a list of all user groups in Modx Revolution
- Cant get Google map working
- Send Mail from MODx Template
- how to use conditional output filter for date field
- Proper way to perform AJAX request from MODx CMP (Custom Manager Page)
- MODx second runProcessor returns response of the first one
- Group 'input option values' in template variable with 'listbox' type
- Why is Modx Cloud turning my links to the cloud address whenever I preview a page?
- .htaccesss RewriteRule won't work
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Popular Tags
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
A very good dissection of the differences between both algorithms can be seen in Dijkstra’s Algorithm versus Uniform Cost Search or a Case Against Dijkstra’s Algorithm. I just quote you some of the conclusions from Arial Felner:
As we suspect, both algorithms are equivalent from the theoretical point of view.
Thus,
In summary, UCS and modified Dijkstra are equivalent in their big O complexity, expand the same nodes and in the same order, but UCS should be preferred from a practical point of view and it is more widely used when approach the single source - single destination problem without heuristic information.