Minimum Spanning Tree Dynamic Demonstration System Implementation

Article Preview

Abstract:

The graph vertices design into classes, for each vertex in the design of the abscissa, ordinate and in-degree members, realizes the dynamic demonstration minimum spanning tree. Dynamic visualize Prime algorithm and kruskal algorithm implementation process. Around two window synchronization of animation, " in order to find the minimum edge " list box list the minimum edge of a minimum spanning tree ,with thick line in the left window drawing the found minimum edge and On the edge of the vertex, in the right box demo the process of algorithm dynamic execution.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2526-2530

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Weimin Yan, Weimin Wu, Data structure in C: Tsinghua University press, 2007, in Chinese.

Google Scholar

[2] Xiaodong Wang, Data structure in C++: Science press, 2008, in Chinese.

Google Scholar