最近写了个最大生成树,根据两个节点之间的互信息作为边的权重来进行编写。
希望能够有所帮助~~
思路是先放到set中一个点,然后找到所有与set相连的边,按照降序排列,依次选择判断是否满足prime的条件~~
function [] = MaxTree()
H = importdata('H.mat');
mutualInfo = importdata('mutulInfo.mat');
adjacentTree = cell(1,50);
for qid = 1:50,
hNotZero = find(H{qid} ~= 0 );
adjacentTree{qid} = zeros(length(hNotZero),length(hNotZero));
fprintf('=====================query%d nodes%d========================\n',qid,length(hNotZero));
set = mutualInfo{qid}(1,1);
count = 0;
for i = 1:(length(hNotZero) - 1)
edge = [0,0,-100];
for j = 1:length(set)
edge_1 = find(mutualInfo{qid}(:,1)=&