307
个编辑
更改
→Maximum spanning tree
最大生成树
最大生成树
The initial step in building a network representation of product relatedness (proximities) involved first generating a network framework. [[File:ProductSpaceMST.png|thumb|left|upright=2|The maximum spanning tree represents the first step in visualizing the Product Space network.]]Here, the maximum spanning tree (MST) algorithm built a network of the 775 product nodes and the 774 links that would maximize the network's total proximity value.
The initial step in building a network representation of product relatedness (proximities) involved first generating a network framework. [[File:ProductSpaceMST.png|thumb|left|upright=2|The maximum spanning tree represents the first step in visualizing the Product Space network.最大生成树表示可视化产品空间网络的第一步。]]Here, the maximum spanning tree (MST) algorithm built a network of the 775 product nodes and the 774 links that would maximize the network's total proximity value.
The initial step in building a network representation of product relatedness (proximities) involved first generating a network framework. The maximum spanning tree represents the first step in visualizing the Product Space network.Here, the maximum spanning tree (MST) algorithm built a network of the 775 product nodes and the 774 links that would maximize the network's total proximity value.
The initial step in building a network representation of product relatedness (proximities) involved first generating a network framework. The maximum spanning tree represents the first step in visualizing the Product Space network.Here, the maximum spanning tree (MST) algorithm built a network of the 775 product nodes and the 774 links that would maximize the network's total proximity value.
构建产品相关性(邻近性)网络表示的第一步为生成一个网络框架。此处，最大生成树(MST)算法建立了一个网络的775个产品节点和774个链接，将网络的总邻近值最大化。
构建产品相关性(邻近性)网络表示的第一步为生成一个网络框架。此处，最大生成树(MST)算法建立了一个网络的775个产品节点和774个链接，将网络的总邻近值最大化。
===Network layout===
===Network layout===