Abstract:
To search the SSC in SRN, this paper brings forward a depth first diffusion algorithm. It traverses all out-arcs on each node and selects the nodes connected with those out-arcs which have minimum weight for the next traversal. At the worst, if the SRN is a regular m-tree, thecomplexity is two times as much as the number of nodes in SRN.
Key words:
Service supply chain; Service relation network; Depth first; Diffusion
摘要： 用服务关系网刻画服务实体间服务关系的耦合情况；然后论述了计算服务链数量的定理并证明；最后提出在赋权服务关系网中的服务供应链深度优先的扩散构建算法，分析了算法的最坏时间复杂性。
关键词:
服务供应链；服务关系网；深度优先；扩散
YANG Zhe, ZHANG Dalu. Depth-first Diffused Formation Algorithm of Service Supply Chain[J]. Computer Engineering, 2006, 32(6): 11-13，16.
杨 哲，张大陆. 服务供应链深度优先扩散构建算法[J]. 计算机工程, 2006, 32(6): 11-13，16.