MINCONNECT 1.0

MINimal CONNECTivity (adjacency) matrix for (X,Y) points on a plane, and/or graph of connections. Needs CLINE.Applications: graph theory, optimal traffic, astronomy (e.g. if youwant to see a tree of connected stars selected according to certain bounds on distance and/or magnitude etc).The connections obey following optimality condition:breaking any connection divides all points into two groups such thatthe broken connection corresponds to the shortest distance betweenthe two groups. Algorithm: a cluster of already connected points grows by addingthe nearest of resting points Call: [M,ZZ]=minconnect(X,Y[,colspec]); (brackets="optional colspec")[M,ZZ]=minconnect(X[,colspec],Y); [M,ZZ]=minconnect(XY[,colspec]);(XY means [X(:), Y(:)] or X+1i*Y) [M,ZZ]=minconnect([colspec,]XY);Input: X = vector of abscissas Y = vector of ordinates colspec: color/marker/line specification as in CLINE: if set, connection tree is shown X,Y and colspec (or XY and colspec) may be entered in any sequence, but X should precede YOutput: M = minimal connectivity (adjacency) matrix: M(i,j)=true,if i

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Abscissas,  Addingthe,  Brackets Dquotoptional,  Cluster,  Colormarke,  Colspec,  Colspecquotmzz Dminconnectxcolspecy,  Grows,  Means,  Mzz Dminconnectcolspecxyinput,  Mzz Dminconnectxycolspec,  Mzz Dminconnectxycolspecxy,  Nearest,  Ordinates,  Resting,  Vector,  X2b1iy
Users rating:	0/10