Last Updated
：2025/11/24
Quizzes for review
(graph theory) In a directed graph, a path in which the edges are all oriented in the same direction.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
directed path
To prove the theorem, we constructed a directed path from vertex u to vertex v that avoids all forbidden edges.
See correct answer
To prove the theorem, we constructed a directed path from vertex u to vertex v that avoids all forbidden edges.
音声機能が動作しない場合はこちらをご確認ください
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
