-->
当前位置:首页 > 题库

题库 第6491页

  • 最新
  • 浏览
  • 评论

Prim's algorithm is to grow the minimum spanning tree by adding

Luz5年前 (2021-05-10)1061
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

Luz5年前 (2021-05-10)1163
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

Luz5年前 (2021-05-10)997
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

Luz5年前 (2021-05-10)1031
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

Luz5年前 (2021-05-10)967
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

Luz5年前 (2021-05-10)2308
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

Luz5年前 (2021-05-10)1260
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

Luz5年前 (2021-05-10)1006
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

Luz5年前 (2021-05-10)1098
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.

Luz5年前 (2021-05-10)888
You can override a static method defined in a superclass. ~@[](2)答案:FALSE…