Exploration of simple graphs by a collective of agents

The article addresses the problem of exploring simple undirected graphs using a multi-agent system consisting of two agents: an agent-researcher, which can traverse the graph, read and modify the labels of its elements, and exchange information with the second agent – an agent-experimenter, which constructs a map of the explored graph in its memory in the form of edge and node lists. An algorithm is proposed with quadratic time, space, and communication complexities (with respect to the number of nodes in the graph). The upper estimate of the number of transitions along the edges made by the agent-researcher is estimated as O(n2). The algorithm operates using one color and one stone. An algorithm is based on depth-first traversal method.