Selection of Data Structures for Graph Representation while Solving Combinatorial and Optimizational Problems

The application efficiency of various data structures for graph presentation is estimated by the time of the execution of graph transformation operations and size of the structure implementation scheme. The analysis of basic data structures is performed. Results of the time estimations are given for the execution of operations of determining the connection of two specified nodes, finding all nodes, connected with the given one, and deleting a node, as well as size estimations for eight alternative data structures intended for the graph matrix and analytical representation.