A.屋面排水管
B.屋面变形缝
C.墙面涂膜防水
D.屋面天沟
E.涂膜屋面的油膏嵌缝
第1题
A、当图中不存在负权回路但是存在负权边时,Dijkstra算法不一定能求出源点到所有点的最短路。 When the graph doesn't contain circuit of negative weight, but contains the edge of negative weight. Dijkstra algorithm can't guarantee the correctness of the algorithm.
B、当图中不存在负权边时,Dijkstra算法能求出每对顶点间最短路径。 When the graph doesn't contain edge of negative weight, Dijkstra algorithm can calculate the shortest path of each pair of vertices.
C、当图中存在负权回路时,Dijkstra算法也一定能求出源点到所有点的最短路。When the graph contains the circuit of negative weight, Dijkstra algorithm can certainly calculate the shortest path form the single source to all the vertices.
D、Dijkstra算法不能用于每对顶点间最短路计算。Dijkstra algorithm can't be applied to calculate the shortest path of each pair of vertices.
第6题
A、The room key.
B、The empty flask
C、The deposit
D、Your passport.
第10题
根据树的双标记层次遍历序列,求其带度数的后根遍历序列 Given the double-tagging level-order traversal sequence of a tree, please write down the post-order traversal sequence with degree. 比如:已知一棵树的双标记层次遍历序列如下: For example, assume that a tree's double-tagging level-order traversal sequence is shown as followed:
为了保护您的账号安全,请在“上学吧”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!