题目内容

How many edges does the minimum spanning tree of a connected graph G with n vertices have?

A. n-1
B. n
C. n+1
D. Uncertain

查看答案

搜索结果不匹配？点我反馈

更多问题

If there are 20,000 elements in S, if only the 10 smallest elements are required, then which is the most efficient method.

A. shell sort
B. heap sort
C. bubble sort
D. radix sort

When a tree is transformed into a binary tree, the right subtree of root node in binary tree is always empty.

The adjacency matrix of a given graph is unique.

The topological sequence of any directed acyclic graph is unique.