Storage Model of Graph Based on Variable Collection

Article Preview

Abstract:

As the traditional implements of graph are complicated in data structure and hard to maintain, or short in storage utilization and low computational efficiency, this paper designs one storage model of graph based on variable collection according to the object oriented method, and implements it with the variable collection data type that high level programing languages process. Comparing with adjacency matrix and list, analysis and cases show that this model is comprehensible and extensible with high calculation efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

1456-1460

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Gross, Jonathan L., & Yellen, Jay, ed. Handbook of Graph Theory. CRC Press (2003).

Google Scholar

[2] Bang-Jensen, J.; Gutin, G. Digraphs: Theory, Algorithms and Applications. Springer (2000).

Google Scholar

[3] Harary, Frank. Graph Theory. Addison Wesley Publishing Company (1995).

Google Scholar

[4] Biggs, Norman. Algebraic Graph Theory (2nd ed. ). Cambridge University Press (1993).

Google Scholar

[5] Duane A. Bailey. JavaTM Structures: Data Structures in JavaTM for the Principled Programmer [M]. Boston: WCB/McGraw-Hill, 1999: 293-309.

Google Scholar

[6] Trudeau, Richard J. Introduction to Graph Theory (Corrected, enlarged republication. ed. ). New York: Dover Pub. Retrieved 8 (2012), p.19.

Google Scholar

[7] Gross, Jonathan L.; Yellen, Jay. Graph Theory and Its Applications. CRC Press(1998).

Google Scholar

[8] Biggs, Norman. Algebraic Graph Theory (2nd ed. ). Cambridge University Press. (1993).

Google Scholar

[9] Michael T. Goodrich and Roberto Tamassia. Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons (2002).

DOI: 10.1145/992287.992293

Google Scholar

[10] Dijkstra, Edsger; Thomas J. Misa, Editor. An Interview with Edsger W. Dijkstra. Communications of the ACM, 2010, 53 (8): 41–47.

DOI: 10.1145/1787234.1787249

Google Scholar