皮皮学，免费搜题
登录
搜题
【单选题】
求连通网的最小生成树的prim算法:集合V,E分别存放顶点和边,初始时V为网中任意一点,E为空,下面步骤重复n-1次:选i属于V,j不属于V,且(i,j)上的权最小,( ),最后E中的边为最小生成树。A.
顶点i加入V，(i,j)加入E
B.
顶点j加入V，(i,j)加入E
C.
顶点j加入V，(i,j)从E中删去
D.
顶点i,j加入V，(i,j)加入E
拍照语音搜题，微信中搜索"皮皮学"使用
参考答案：
参考解析：
知识点：
皮皮学刷刷变学霸
举一反三
【单选题】Sony's Vision For The Future As the television, communications and telecommunications industries emerge, compatibility (兼容性) becomes a big issue for consumers. I think we should maintain open and comp...
A.
To praise Japanese restaurants for offering good services.
B.
To explain that Japanese restaurants are distinctive.
C.
To explain what has just been said.
D.
To emphasize that restaurants are all alike.