Last Updated:2025/12/03

To efficiently traverse the graph, implement an adjacency list rather than an adjacency matrix when the graph is sparse.

See correct answer

To efficiently traverse the graph, implement an adjacency list rather than an adjacency matrix when the graph is sparse.

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)
Source Sentence

グラフを効率的に走査するには、グラフが疎な場合は隣接リストを実装し、隣接行列の代わりにそれを使ってください。

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★