p.2507
p.2511
p.2517
p.2521
p.2526
p.2531
p.2536
p.2540
p.2549
Minimum Spanning Tree Dynamic Demonstration System Implementation
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.
Info:
Periodical:
Pages:
2526-2530
Citation:
Online since:
September 2013
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: