Graph Traversal Dynamic Demonstration System Design and 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 graph traversal algorithm. Around two window synchronization of animation, " traversal sequence " list box list dfs (bfs ) traversal sequence ,with thick line in the left window drawing traversed through the vertices and edges, and in "traversed stack (queue) changes in" real-time text box displays the current traversed through vertices, in the right box demo the process of algorithm dynamic execution.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 734-737)

Pages:

2959-2963

Citation:

Online since:

August 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