统一成本搜索和Dijkstra算法之间有什么区别? [英] What's the difference between uniform-cost search and Dijkstra's algorithm?

问题描述

我想知道统一成本搜索和 Dijkstra算法有什么区别.它们似乎是相同的算法.

I was wondering what's the difference between uniform-cost search and Dijkstra's algorithm. They seem to be the same algorithm.

推荐答案

Dijkstra的算法，也许是众所周知的，可以认为 作为统一成本搜索的一种变体，其中没有目标状态，并且 处理将继续进行，直到将所有节点都从该节点中删除为止. 优先级队列，即直到所有节点的最短路径(不仅仅是 目标节点)

Dijkstra's algorithm, which is perhaps better-known, can be regarded as a variant of uniform-cost search, where there is no goal state and processing continues until all nodes have been removed from the priority queue, i.e. until shortest paths to all nodes (not just a goal node) have been determined

http://en.wikipedia.org/wiki/Uniform-cost_search#Relationship_to_other_algorithms

这篇关于统一成本搜索和Dijkstra算法之间有什么区别?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！