[理工] [資結]資料結構dfs問題
想請問一下
如果一個graph有10個點
點與點所連接的邊也有鍵值
點本身也有鍵值
如果要進行dfs(4)或bfs(4)
那是該找尋edge最小的先走,還是node最小的先走??
ex:node(4)與node 1.5.7相連接,(4.1)=10 (4.5)=5 (4.7)=2
這樣的話是要先走node(1)還是node(7)??
謝謝~
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.217.231.168
→
03/15 17:16, , 1F
03/15 17:16, 1F
→
03/15 17:20, , 2F
03/15 17:20, 2F
→
03/15 17:20, , 3F
03/15 17:20, 3F
→
03/15 17:24, , 4F
03/15 17:24, 4F
→
03/15 17:38, , 5F
03/15 17:38, 5F
→
03/15 17:38, , 6F
03/15 17:38, 6F
推
03/15 22:53, , 7F
03/15 22:53, 7F
→
03/15 23:35, , 8F
03/15 23:35, 8F
→
03/15 23:36, , 9F
03/15 23:36, 9F
→
03/15 23:36, , 10F
03/15 23:36, 10F