单选题：Graph G is an undirected completed graph of 20 nodes. Is there a

Graph G is an undirected completed graph of 20 nodes. Is there an Euler circuit in G? If not, in order to have an Euler circuit, what is the minimum number of edges which should be removed from G? @[B](2)

A. Yes, Graph G has an Euler circuit
B. No, Graph G has no Euler circuit. 10 edges should be removed.
C. No, Graph G has no Euler circuit. 20 edges should be removed.
D. No, Graph G has no Euler circuit. 40 edges should be removed.



A.Yes, Graph G has an Euler circuit
B.No, Graph G has no Euler circuit. 10 edges should be removed.
C.No, Graph G has no Euler circuit. 20 edges should be removed.
D.No, Graph G has no Euler circuit. 40 edges should be removed.


答案：B