题目内容

设图G采用邻接表存储,则拓扑排序算法的时间复杂度是( )。

A. O(n)
B. O(n+e)
C. O(n2)
D. O(n*e)

查看答案

搜索结果不匹配？点我反馈

更多问题

已知有向图G=(V,E)，其中V={V1,V2,V3,V4,V5,V6,V7}，

A. {,,,,,,,,},G的拓扑序列是（）。
B. V1,V3,V4,V6,V2,V5,V7
C. V1,V3,V2,V6,V4,V5,V7
D. V1,V3,V4,V5,V2,V6,V7
E. V1,V2,V5,V3,V4,V6,V7

在有向图中判断是否存在回路常用的算法是____________。

1. Listen to a story about Jack’s fear and decide whether the following statements are T (true) or F (false).[音频]1. When Jack gets into bed, he thinks there’s somebody hiding under the bed.2. As Jack lies under the bed, there must be somebody sleeping on top of it.3. The doctor asks Jack to see him three times a week for two years to cure his fears.4. The doctor charges Jack $200 a visit.5. Jack is willing to pay the amount the doctor charges.

建设工程竣工验收后，在规定的保修期内，因勘察、设计、施工、材料等原因造成的质量缺陷，应当由负责维修、返工或更换，由责任单位负责赔偿损失。