Last Updated：2025/12/06
Sentence
辺に重みのある有向グラフで最短経路を計算する際、全点対最短経路を求めるジョンソンのアルゴリズムの実装は、ダイクストラ法を繰り返し実行する方法よりも高速でした。
Quizzes for review
When computing shortest paths in a dense, edge-weighted directed graph, our implementation of Johnson's algorithm outperformed repeated runs of Dijkstra's algorithm.
See correct answer
When computing shortest paths in a dense, edge-weighted directed graph, our implementation of Johnson's algorithm outperformed repeated runs of Dijkstra's algorithm.
音声機能が動作しない場合はこちらをご確認ください
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
