[理工] [資結]-tree and grap

看板Grad-ProbAsk作者NOtWorThy (分子小於64)時間16年前 (2010/01/29 23:40)推噓4(4推 0噓 8→)

留言12則, 5人參與討論串1/1

a)If undirected grap is connected, there must exist more than one spanning tree. // why true ?? 若原本圖就是tree,那spanning tree不就不會超過一種嗎?? b)If we use adjacency matrix to reprent the undirected grap, the time of DFS and BFS are all O(n*n), n is number of vertex // 這題不太懂 c)There has more than one topology sort in AOV network // why false ?? 不是會超過一種嗎?? Which time complexity is O(nlogn) Delet min in binomial heap // 不是O(logn)嘛?? Merge two leftist heap as a leftist // why?? Search a n item in splay tree in amortimed analysis // why?? 煩請高手不吝賜教感激不盡!! -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 219.70.230.32

推

assassin88

01/30 00:04, , 1^F

01/30 00:04, 1^F

推

assassin88

01/30 00:10, , 2^F

01/30 00:10, 2^F

→

assassin88

01/30 00:10, , 3^F

01/30 00:10, 3^F