Is Dijkstra's algorithm Greedy Programming or Dynamic Programming? What are the benefits of utilising Bellman-Ford instead of Dijkstra?

Is Dijkstra's algorithm Greedy Programming or Dynamic Programming? What are the benefits of utilising Bellman-Ford instead of Dijkstra?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, mphasis, company-specific

目标公司: Mphasis

参考答案摘要

Let's see if you can say both. Since we always mark the nearest vertex, it's greedy. Because distances are adjusted using previously determined values, it is dynamic. However, I'd say it's more akin t...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。