Algorithm for Union of Oriented Graph Parts

In the paper, we consider a task of uniting graphs with a common part. The graphs were received as the result of series of simulations of a Petri net using a program package Colored Petri Nets Tools, where a process address space is restricted by $2^{32}$ bytes starting from different vertices and with different initial conditions. To solve this task, it is necessary to determine the graphs common part, to perform graphs cutting in such a way that their common part remains in only one of the initial graphs, and compose a table of accordance (transitions) between the graphs vertices for making transitions between them. Firstly, we assume that the graphs are represented in the form of adjacency lists. During algorithm's work they are converted into hash tables for fast determination of the common part of the graphs that is implemented with the help of traversing one of the graphs and testing for the presence of nodes in the second graph. A transition table is created with the help of graph traversal by "parents-child" vertex pairs, during which it is checked whether one of the nodes of a pair can be added to the table. The algorithm for solving the problem of uniting the parts of a directed graph is offered, and an example of its use is given.