当前位置：首页
> Luz 第6648页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论In a weighted undirected graph, if the length of the shortest pa
In a weighted undirected graph, if the length of the shortest path from `X` to `Y` is 18, and there exists an edge of we…
Kruskal's algorithm is to maintain a forest and to merge two tre
Kruskal's algorithm is to maintain a forest and to merge two trees into one at each stage. ~@[](1)答案：TRUE…
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…