题目内容
5. For an undirected graph represented by an adjacency list with n vertices and e edges, the storage space occupied is ().
查看答案
搜索结果不匹配？点我反馈
更多问题
6. If a graph with n vertices forms a ring, it has () spanning trees.
7. The minimum spanning tree of any undirected connected network ().
8. To determine whether there is a loop in a digraph, you can use ().
9. Assuming that graph G has n vertices and e edges and adopts adjacency table storage, the time complexity of the topological sorting algorithm is ().
微信支付 
支付宝支付