Last Updated
：2025/12/05
Suurballe's algorithm
Proper noun
Japanese Meaning
非負重み付き有向グラフにおいて、特定の２つの頂点間の、総経路の長さが最小となるような互いに交わらない２つの経路を見つけるアルゴリズム
Quizzes for review
(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Suurballe's algorithm
In our network optimization project, we implemented Suurballe's algorithm to compute two edge-disjoint shortest paths between the source and destination.
See correct answer
In our network optimization project, we implemented Suurballe's algorithm to compute two edge-disjoint shortest paths between the source and destination.
音声機能が動作しない場合はこちらをご確認ください
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
