問題詳情

1.A simplecircuit containing every edge of a graph is called a .
(A) Kruskal circuit
(B) Euler circuit
(C) Turing circuit
(D) Hamilton circuit
(E) Dijkstra circuit

參考答案

無參考答案

內容推薦

內容推薦