[理工] [資結]-中正95-資結

看板Grad-ProbAsk作者IDontBite (IDontBite)時間16年前 (2010/01/24 16:04)推噓3(3推 0噓 2→)

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

Which are correct? (A)We can use Dijkstra's shortest path algorihtm to solve the all pair shortest path problem. (B)A Priority Queue is a kind of Queue data structure. (C)Heapsort is a stable sorting algorithm. (D)A graph has only one minimum cost spanning tree. (E)A biconnected graph does not contain articulation points. 洪逸書上給的答案是BE, A爭議(基本上對,但應該強調是利用single source), 而B選項我覺得應該反過來說才對, Queue是一種以進入時間為priority的Priority Queue, 而Priority Queue不一定符合Queue的FIFO規則, 所以不能算是一種Queue. 各位覺得呢? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 114.32.189.59

推

polomoss

01/24 20:07, , 1^F

01/24 20:07, 1^F

推

FRAXIS

01/24 21:03, , 2^F

01/24 21:03, 2^F

→

taitin

01/24 22:15, , 3^F

01/24 22:15, 3^F