Connected Component Analysis on an Undirected Graph 1.0

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

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Allowed,  Applied,  Automatically,  Diagonal,  Elements,  Parameters,  Removed,  Union,  Values
Users rating:	0/10