Synthesis of Optimal Data Structures for Solving Problems on Graphs

The model is offered which allows one to adequately express characteristic features of the basic data structures used for representation of graph models. An operation of consolidating the basic data structures is formally defined, which makes it possible to automate the computation of time and capacity parameters of the obtained combined data structures. The formal statement is offered for the problem of synthesis of the single-level combined data structure, being optimal from view of minimal computing difficulties of execution of the specified operation set, on condition that the capacity difficulties of the structure are admissible.