Last Updated
：2025/12/03
Floyd-Warshall algorithm
Proper noun
Japanese Meaning
重み付きグラフ（正または負のエッジ重みを持つが、負の閉路は存在しない）において、すべての頂点間の最短経路を求めるアルゴリズム。
Quizzes for review
(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Floyd-Warshall algorithm
When optimizing the network's routing tables, she implemented the Floyd-Warshall algorithm to compute all-pairs shortest paths efficiently, even with negative edge weights as long as there were no negative cycles.
See correct answer
When optimizing the network's routing tables, she implemented the Floyd-Warshall algorithm to compute all-pairs shortest paths efficiently, even with negative edge weights as long as there were no negative cycles.
音声機能が動作しない場合はこちらをご確認ください
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
