答案及解析：[单选题]There is a directed graph G=(V;E) with n nodes and m edges. Can one determine if G is strongly conn - 工学类题库- 答案窝(daanwo.com)-大学生作业答案及考资分享平台

投稿 | 充值 | 收藏

您当前的位置：首页 > 高教类 > 工学类

问题：

[单选题]

There is a directed graph G=(V;E) with n nodes and m edges.

Can one determine if G is strongly connected in O(m+n) time?

AYes

BNo

CDepending on V and

Tags：学堂在线清华大学算法设计与分析(2021春)课后作业题答案

答案解析：

您可能感兴趣的问题

相关问题

[单选题]Given a MAX 3-SAT formula Φ with k clauses, we show that the expected number of clauses satisfied
[判断题]For any instance of 3-SAT, there exists a truth assignment that satisfies at least a 7/8 fraction of
[单选题]There are 8 statements and we have no knowledge about them. We randomly guess them true or false. So
[判断题]The best response dynamics algorithm for k-agent multicast routing problem always finds the best Nas
[单选题]The single-flip neighborhood algorithm for Maximum Cut with nodes runs at most _____ steps.
[单选题]Assume there are n nodes in VERTEX-COVER. The local search algorithm given in this chapter can giv
[判断题]All local search algorithms can stop in finite steps.
[判断题]In knapsack problem, if the weight of each item is integer and less than a given constant. We can so
[单选题]The LPT rule gives an ρ-approximation algorithm for load balancing. Which of the following factors
[单选题]For problem X, now we get a 3-approximation algorithm. Which of the following statement is TRUE? A

关于我们 | 用户指南 | 版权声明 | 给我留言 | 联系我们 | 积分商城 | 答案求助 | 网站地图

Copyright © 2024 www.daanwo.com All Rights Reserved

沪ICP备19038360号-2