kruskal algorithm
2016-08-23
0 0 0
no vote
Other
Earn points
this algorithm is based on the greedy approach. this algorithm is used
to find minimum spanning tree for a connected and undirected graph. this
algorithm is used on weighted edges. A spanning tree of a graph
contains all the vertices of the graph and contains only (n-1) edges of
the graph if graph contains n edges. the difference between this algorithm and prims is that it forms disconnected components of the graph
c
Related Source Codes
PClite
0
0
no vote
generic embeded FTP Client
0
0
no vote
UDP Test Demo
0
0
no vote
TMS320F28335 DSP transmits data to EEPROM through
0
0
no vote
TMS320F28335 CAN communication source code
0
0
no vote
No comment