function [out,len]=kruskal(map) %求最小生成树算法,通过kruskal算法求最优树,并给出相应图像. %用法: % 首先输入矩阵: % map=[起点1 终点1 边长1;起点2 终点2 边长2;.........…
MX 源代码
探索MX技术的无限可能,这里汇聚了120个精选资源,涵盖从基础入门到高级应用的全方位资料。MX技术以其卓越的性能、灵活性及广泛的兼容性,在嵌入式系统、物联网设备开发等领域展现出巨大优势。无论是初学者还是资深工程师,都能在这里找到提升技能所需的一切。立即加入我们,开启您的MX技术学…
function [p,v]=dijkstra(map,u1,u2) %求网络最短路径的dijkstra算法 %用法: % 首先输入矩阵: % map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边…
/*- * Copyright (c) 2002-2006 Sam Leffler, Errno Consulting, Atheros * Communications, Inc. All rights reserved. * * Redistri…
/*- * Copyright (c) 2002-2006 Sam Leffler, Errno Consulting, Atheros * Communications, Inc. All rights reserved. * * Redistri…
/*- * Copyright (c) 2002-2006 Sam Leffler, Errno Consulting, Atheros * Communications, Inc. All rights reserved. * * Redistri…
/*- * Copyright (c) 2002-2006 Sam Leffler, Errno Consulting, Atheros * Communications, Inc. All rights reserved. * * Redistri…
/*- * Copyright (c) 2002-2006 Sam Leffler, Errno Consulting, Atheros * Communications, Inc. All rights reserved. * * Redistri…
/*- * Copyright (c) 2002-2006 Sam Leffler, Errno Consulting, Atheros * Communications, Inc. All rights reserved. * * Redistri…
function D = GKdist(X, Y, A) [mx, nx] = size(X); [my, ny] = size(Y); D = zeros(mx, my); for j = 1 : my W=A{j}; …
function newpop=elite(pop,rank,newpop) mx=max(rank); x=find(rank==mx); [a b]= size(x); newpop(:,1)=pop(:,x(1)); if a>1 n…