Font Size: 

The work is devoted to exploration of linkages in Euclidean k-dimentional space, where k is greater then or equal to 3 and how can they help to find optimal networks. One of results is the description of constructing of 3-dimensional linkage that finds all minimal networks that connects a planar set of n points. There is also the algorithm of modeling weighted graphs in k-dimentional space by means of linkages.