Work

Minimum Spanning Tree Dynamic Demonstration System Implementation

Year: 2013

Type: article

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.

Source: Applied Mechanics and Materials

DOI: 10.4028/www.scientific.net/amm.397-400.2526

Authors: Bang Ze Chen, Xiao Bo Yang

Institution: Xizang Minzu University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Science and Technology Plan Projects of Tibet Autonomous Region

OpenAlex ID: W2011293047

FWCI:

Cites:

Cited by:

Related to: 10