Аннотация:There discussed methods for visualizing huge graphs where edges marked by distances
between vertices. The goal is to reduce graph complexity of huge graph in context of visual
analysis of delays. There we have used some methods of clusterization which save egde
distances. This method usability has been tested on data about delays arrived in
communications of Lomonosov supercomputer.