Communication network simulation. Graph imaging

Imaging is one the most important phases when simulating communication networks. This paper offers one out approach of a variety of approaches to resolving said task. By formalizing conditions once can define the objective as developing and implementing common graph imaging algorithm. Various techniques of graph imaging exist many of which rest on a specific topology: planar graph, trees. This paper considers algorithms for imaging common graphs i.e. algorithms intended for imaging graphs with topology unknown in advance.