On the basis of an algorithm written program, creating EBSD maps based on mathematical graph G = (V, E) in the form of letters, in which the set of vertices V = {v1, ..., vn} is identified with a set of grain products, and the set of edges E = {e1, ..., em} is identified with the relation of grain vi vj neighborhood. Each node of the set of V has not yet assigned an average grain orientation and size (number of pixels of subsequent). The set E is formed from a set of V in the following way. Each grain vi from the set V is expanded by one pixel (up, down, left and right). Then takes into account the part of the common intersection of all the vertices understood as sets of items in a square matrix EBSD maps. Most of these grains will of course be decoupled, and where the information is collected intersect with a length of intersection, disorientation, borders positions in the matrix of the map.