A New Approach to Operating with Undirected Trees

Abstract

A new approach has been developed and practically implemented in the created software package. It ensures the implementation, on undirected trees, of a wide set of basic operations that allows replenishment. The approach does not require the development and use of available types of formalized representation of trees (matrices of adjacency, connectivity, incidence, distance, adjacency lists, etc.), standardized description languages, and specialized programs for constructing and visualization tools for their structure. By reducing the cost of technical resources and time when solving problems from various fields of knowledge by dozens (and hundreds) of times, the approach makes the work as simple and effective as possible, allows us to obtain a number of characteristics that are important in practical terms, to solve the problem of tree isomorphism, and to generate two options of representing the adjacency matrix.