所屬科目:中山◆資工◆作業系統與資料結構
(5) Given the adjacency matrix of an undirected graph:Show the sequence of nodes that you visit by using breadth-first search and depth-first scarch. Ifthere are multiple choices to select nodes, just follow the alphabetical order.
(5) Consider a Fibonacci heap as follows: