The development of graph and matrix ways of representing algorithms

Abstract

The development of graph and matrix ways of representing algorithms

Polyakov V.S., Polyakov S.V., Avdeyuk О.A., Naumov Y.V., Pavlova E.S., Skvortcov M.G.

Incoming article date: 15.05.2017

In the article we consider serial hipping-chart of the abstract algorithm and a bipartite graph. Led the detailed algorithm of such a transformation. We gave an example of the ability to specify the algorithms in the matrix-predicate form. In conclusion, we indicated that the resulting matrix-predicate form is completely identical graphic form, however, allows you to work with algorithms much more efficient, since it is possible to ask them in the matrix predicate and partially automate the heuristic methods of their construction.

Keywords: the algorithm graph-diagram, bipartite graph, set, matrix, predicate, logical operator, the circuit