Connected Component Analysis on an Undirected Graph 1.0Related Scripts Categories:
Other Languages 
Software & System 
Tools & Utilities 
Tutorials & Articles 
Web Hosting Tools
Connected component analysis on undirected graphs, with thresholding and connectivity constraints. Tristan Ursell, (c) 2012Connected component analysis on an undirected graph, with variousthresholding and connectivity constraints.[groups,orphans] = graph_analysis(W);[groups,orphans] = graph_analysis(W,'field',value,...);[groups,~] = graph_analysis(W,'field',value,...);W is the N x N adjaceny matrix for a symmetric graph. Thus W should be a symmetric matrix, if it is not, this function will give an error. Self connections (i.e. diagonal elements) are not allowed and will be removed automatically. The values of the parameters below are applied as a union set, that is, all original elements must meet all of the conditions specified by the parameters to be included in a group.If only W is given, then all components with W>0 will be analyzed and grouped, with the default constraints.'min_conn' (1 Tags: Parameters, Applied, Union, Values, Automatically, Diagonal, Elements, Allowed, Removed Platforms: BSD , Mac OS X , Solaris , linux
Tags: Parameters, Applied, Union, Values, Automatically, Diagonal, Elements, Allowed, Removed More Scripts from Tristan Ursell: More Similar Scripts
Similar Software

Scripts Categories
Related Scripts
Principal Component Analysis: A Simulink Block 1.0
Prims Algorithm 1.0
Multilinear Principal Component Analysis (MPCA) 1.0
CellSort 1.0
Largest Component 1.0
RAFisher2cda 1.0
Yfiles Graph Layout Library 2. 2. 2001
APAC algorithm 1.0
PCA (Principial Component Analysis) 1.0
Count all cycles in simple undirected graph 1.0 Popular Scripts
