Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability

Algorithm 1

Finding driver nodes in each connected component.

Input:;

Method:

() Compute from (19);

() Compute graph reachability matrix ;

() ;

() while do

() ;             % represents the number of driver nodes.

() ;        % represents the vector of the number of nonzero elements in each column.

() ;      % represents the column with the largest graph reachability index.

() ;       % represents the array of driver nodes.

() ;     % represents the rows with nonzero elements in the driver node column.

()   ;

() end while