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

答案:登入後查看
統計: 尚無統計資料