Upload Code
loading-left
loading loading loading
loading-right

Loading

Profile
No self-introduction
codes (2)
Kruskal algorithm of minimum spanning tree
no vote
C language algorithm programming. Kruskal algorithm of minimum spanning tree. An algorithm for finding the minimum spanning tree of weighted connected graph. In Kruskal algorithm, n-1 edges are selected, and the greedy criterion is to select an edge with the least cost from the remaining edges and add it to the set of selected edges. Note that if the selected edges generate loops, it is impossible to form a spanning tree. Kruskal algorithm is divided into e steps, where e is the number of edges in the network. Consider the e edges in the order of increasing cost, one edge at a time. When considering an edge, if it is added to the set of selected edges, a loop will appear, then it will be discarded, otherwise it will be selected.
li892202087
2020-01-15
0
1
Matlab mouse drawing
no vote
Matlab Sketchpad program, the use of GUI interface to create a drawing board, the left mouse button to draw, the right mouse button to click to clear the already drawn graphics.
li892202087
2020-01-15
1
1
No more~