Mathematical methods of identifications for visual information. 2.

Abstract

We continue grinding wooden graphic-theory for own needs, which we started in the first paper of this series. In this article we will assume that the graph is connected. We construct a minimum forest consisting of the union of the minimal spanning trees of its connected components. Because of its importance in operational research and in data analysis, many algorithms have been proposed for constructing a minimal spanning tree of a valued graph.