MINCONNECT

adjacency matrix/plot of minimally connected X,Y points
ダウンロード: 2.6K
更新 2006/2/13

ライセンスがありません

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 you
want 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 that
the broken connection corresponds to the shortest distance between
the two groups.

Algorithm: a cluster of already connected points grows by adding
the 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 Y

Output:
M = minimal connectivity (adjacency) matrix: M(i,j)=true,
if i<j and point number i is connected with point number j
ZZ=(complex) start and finish of all connections

引用

Vassili Pastushenko (2024). MINCONNECT (https://www.mathworks.com/matlabcentral/fileexchange/9961-minconnect), MATLAB Central File Exchange. 取得済み .

MATLAB リリースの互換性
作成: R14
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linux
カテゴリ
Help Center および MATLAB AnswersGraph and Network Algorithms についてさらに検索

Community Treasure Hunt

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

Start Hunting!
バージョン 公開済み リリース ノート
1.0.0.0