Method of the decision of digraphs problem on the base of complexity

Abstract

The method of the decision of distinction of digraphs problem is offered. The basis of this method is defined on matrix model of complexity, which takes into account the quantitative and qualitative characteristics of digraph fragments. The model for the first time allows to calculate the importance of each digraph fragment of digraph in its total complexity. The results of the decision of problems of distinction and definition of similarity for digraphs are given.