Last Updated
：2025/11/26
depth-first search
（ plural ）
Quizzes for review
(graph theory) An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
depth-first search
To find a path from the root to a target node, the program performs a depth-first search on the graph.
See correct answer
To find a path from the root to a target node, the program performs a depth-first search on the graph.
音声機能が動作しない場合はこちらをご確認ください
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
