题库 第6491页
Prim's algorithm is to grow the minimum spanning tree by adding
Prim's algorithm is to grow the minimum spanning tree by adding one edge, and thus an associated vertex, to the tree in…
Prim's algorithm is to maintain a forest and to merge two trees
Prim's algorithm is to maintain a forest and to merge two trees into one at each stage. ~@[](1)答案:FALSE…
If graph G is a connected graph, the spanning tree of G is a max
If graph G is a connected graph, the spanning tree of G is a maximal connected subgraph containing all n vertices of G.…
Kruskal's algorithm is to grow the minimum spanning tree by addi
Kruskal's algorithm is to grow the minimum spanning tree by adding one edge, and thus an associated vertex, to the tree…
If graph G is a connected graph, then G must have a unique minim
If graph G is a connected graph, then G must have a unique minimum spanning tree. ~@[](2)答案:FALSE…
The minimum spanning tree of a connected weighted graph with ver
The minimum spanning tree of a connected weighted graph with vertex set V={ A, B, C, D, E } and weight set W={ 1, 3, 2,…
To sort $$N$$ records, heap sort requires at least $$O(N)$$ extr
To sort $$N$$ records, heap sort requires at least $$O(N)$$ extra space. ~@[](1)答案:FALSE…
The best "worst-case time complexity" for any algorithm that sor
The best "worst-case time complexity" for any algorithm that sorts by comparisons only must be $$O(NlogN)$$. ~@[](1)答案:T…
A protected datum or method can be accessed by its subclasses in
A protected datum or method can be accessed by its subclasses in any package. ~@[](2)答案:TRUE…
You can override a static method defined in a superclass.
You can override a static method defined in a superclass. ~@[](2)答案:FALSE…