现在需要对所有的产品画一个maximum spanning tree ,其条件是 :
We generated the MST by considering the strongest non-diagonal value of the proximity matrix and then considered the strongest link connected to that dyad. We then picked up the strongest link connecting a new node to our triad and continued adding links until all the nodes on the network were considered 。
我理解的大意是,从某个产品(就是node)入手,把与他相似度最高的产品连接起来,以此类推,直到把所有的产品都包含在这个图内。
希望有大神可以给我点提示 matlab怎么实现呢
真的非常非常感谢!