Algorithm 21.4: Jarnik-Prim. More...
Go to the source code of this file.
Functions | |
| function | jarnikPrim (in adj, in cost) |
| Identifies the minimum spanning tree of an undirected network. More... | |
Detailed Description
Algorithm 21.4: Jarnik-Prim.
Implementation of algorithm 21.4 of [1]
- Note
- Tested with run2120.m
- Date
- Sun Mar 29 17:54:11 2015
Definition in file jarnikPrim.m.
Function Documentation
◆ jarnikPrim()
| function jarnikPrim | ( | in | adj, |
| in | cost | ||
| ) |
Identifies the minimum spanning tree of an undirected network.
- Parameters
-
adj the symmetric adjacency matrix of the undirected network. It is a 
matrix, such that the element at row i and column j, and the element at row j and column i, contain to the id of the edge (i,j). The numbering should be from 1 to n. cost a vector of size n containing the cost of each edge