Optimization Mode Research of Weighted Undirected Graph

Article Preview

Abstract:

An algorithm is described for constructing a weighted undirected graph structure, based on the principle of directed acyclic graph, used the improved Floyd algorithm to improve the multi-node version of the evolution of information in order to release as an indicator of difference, to improve the reliability of multiple versions of data storage and multi-version storage and query efficiency. Theory and examples show that efficiency is improved using the optimization model in multi-node information system.

You have full access to the following eBook

Info:

Periodical:

Pages:

211-216

Citation:

Online since:

December 2011

Export:

Share:

Citation:

[1] Zhu ming, Dou Wanfeng. The technology for improved multiple versions in coordinated graphics edit system [J], COMPUTER SYSTEMS, 2007. 28(7): 1318-1321.

Google Scholar

[2] Shao Weifeng, Yang yang. The storage and query of multiple versions documents of XML in coordinated edit system [J], Computer Engineering, 2006. 32(24):75-77.

Google Scholar

[3] Zhu Canshi. A kind of optimization method research for Warshall and Floyd algorithm [J], Computer and Modernization, 2010. (4):43-45.

Google Scholar