Quizzes for review
To find the shortest path in an unweighted graph, we performed a breadth-first search starting at the root node.
See correct answer
To find the shortest path in an unweighted graph, we performed a breadth-first search starting at the root node.
音声機能が動作しない場合はこちらをご確認ください
Related words
breadth-first search
Noun
countable
uncountable
Japanese Meaning
幅優先探索：グラフ理論における探索アルゴリズムの一種で、根（開始）ノードから始め、まずその隣接ノードを全て探索していく手法。
Related Words
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
