Prefractal graphs in designing compound structures

This paper is devoted to the new method of designing compound structures. The method is based on using structural properties of prefractal graphs. The parallel algorithm of searching shortest path on prefractal graph is described also in paper. The algorithm is made parallel owing to the fact that the self-similarity is structural property of prefractal graphs. The computational complexity of this parallel algorithm is lower than the computational complexity of well-known algorithms of searching shortest path on graphs.