※ 引述《c10401 (咖啡)》之銘言：
: 目前正在研究國外資料，但實在想不出 F[i]=?
: The importance of node i, F(i) is defined as the number of
: all independent paths including the node i in the network
: G,, where i = 1, 2, ... n-k.
: It should be noted that if there are two paths which share
: common nodes, the path which have minimum jumps
: should be chosen.
: 以下是範例:https://imgur.com/a/qkWA2W2
:1. 能否請各位大大協助提供各節點的值(路徑)怎麼得到的，感謝
2. 請問有web網頁或是軟體可快速獲得各節點對外有多少路徑嗎?謝謝
參考文章來自
https://bit.ly/2EY72kk
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 140.113.0.229 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Math/M.1565344515.A.81E.html