Last Updated:2025/11/23
Sentence

そのアルゴリズムは、各頂点をちょうど一度ずつ訪れて出発点に戻るように、最初と最後の頂点が辺で結ばれたハミルトン路(ハミルトン閉路)を効率的に見つけた。

Quizzes for review

The algorithm efficiently found a Hamiltonian cycle that visits every vertex exactly once and returns to the starting point.

See correct answer

The algorithm efficiently found a Hamiltonian cycle that visits every vertex exactly once and returns to the starting point.

音声機能が動作しない場合はこちらをご確認ください

Related words

Hamiltonian cycle

Noun
Japanese Meaning
グラフ理論において、すべての頂点を一度ずつ訪問し、最初の頂点に戻る閉路(ハミルトン閉路)を指す。
What is this buttons?

そのアルゴリズムは、各頂点をちょうど一度ずつ訪れて出発点に戻るように、最初と最後の頂点が辺で結ばれたハミルトン路(ハミルトン閉路)を効率的に見つけた。

Related Words

plural

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
Editing Guideline

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★