Last Updated
：2025/11/26
Bellman-Ford algorithm
Noun
Japanese Meaning
ある始点からすべての頂点への最短経路を計算するアルゴリズム。重み付き有向グラフにおいて、負の重みを持つ辺にも対応可能である。
（ plural ）
Quizzes for review
(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Bellman-Ford algorithm
When a graph may contain negative edge weights, you should use the Bellman-Ford algorithm to compute single-source shortest paths.
See correct answer
When a graph may contain negative edge weights, you should use the Bellman-Ford algorithm to compute single-source shortest paths.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
