This is where navigation should be.


GSP_CHECK_CONNECTIVITY - Check if the graph G is aperiodic strongly connected

Usage

bool=gsp_check_connectivity( G );
bool=gsp_check_connectivity( L );
bool=gsp_check_connectivity( W );
[bool,in,out]=gsp_check_connectivity( ... );

Input parameters

G, W, L Graph, Laplacian matrix or Weight martrix
param Optional parameters

Output parameters

bool Boolean
in Nodes without any in connections
out Nodes without any out connections

Description

Test if each node have at least one in connection and one out connection. If this simple test give good results, the function compute the perron vector of G and test it. It might take some time.

param is an optional structure that contains the following field

  • param.verbose: display parameter - 0 no log - 1 display the errors