Structural Matrix for Algorithm Flow Graph Representation in Computer

The paper describes the conventional matrix methods and proposes the structural matrix for the algorithm graph representation. The flow of the structural matrix design and its application for the structural characteristics of the algorithm calculation is described. Performed comparison of matrix methods for the algorithm graph representation shows that for structural analysis of the algorithms in terms of the efficiency of their implementation in both the sequential computational model and in the different parallel computational models it is best to use the structural matrix. The proposed structural matrix of an algorithm represents its structure in a suitable for its processing form and compare to the adjacency and incidence matrices requires great less memory capacity and does not need the additional operations performed for the algorithm flow graph building, displays, and keeps the structure of the algorithm.