Description: Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
- [minitree] - This is the VC search for a minimum span
- [prim] - 1. Revealed that the graph adjacency mat
- [mintree] - Minimum spanning tree of the C language
- [Skin.ZIP] - DNN (DotNetNuke) is a site skin software
- [1WIRE_C51] - One-line communication protocol procedur
- [23825741Moving_Least_Squares] - Matlab moving least square procedure, su
- [AT89C2051_motor] - AT89C2051 stepper motor drive circuits a
File list (Check if you may need any files):
Download