plot minimum spanning tree

1 次查看（过去 30 天）
shuaa alharbi
shuaa alharbi 2016-6-8
I calculated MST according to the euclidian distance between each point. I used this code to colored the MST edges according to weight but it doesn't work !!
%% Compute minimal spanning tree [G,pred] = graphminspantree(G,'Method','Kruskal');
%% nn = 20; cmap = jet(nn); p1 = min(pred); p2 = max(pred); [h,idx] = histc(pred,p1:(p2-p1)/(nn-1):p2); x = V(:,1); % graph vertices y = V(:,2); figure; for i=1:length(pred) plot(x(i),y(i),'-','color',cmap(idx(i),:)); >>> the proplem here hold on; end end

请先登录，再回答此问题。

回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by