Graph visualization algorithms, where to get information from?

Question

Mathematics

So, we need to find an algorithm such that at the input there is a two-dimensional adjacency matrix of the graph, and at the output we get its correct location on the plane, i.e. coordinates of all vertices. I know that for this purpose there are power algorithms in which each vertex is represented as a charge, and the edges are a connection between them and they look for an equilibrium point for such a system, but the problem is that the only source that I found (I won’t give a link, since still could not understand how local moderation relates to them and which ones are possible and which are not) quite a long time ago and, firstly, describes the problem rather from a theoretical point of view (software implementation is discussed extremely briefly and superficially), and secondly, almost all formulas there were apparently presented in a picture form and now most have died safely, leaving the inscription "Formula" in its place. Where can I get information on this subject. (If you know any other, non-power algorithm, I'll be glad anyway. But don't offer "circular" (where all vertices are arranged in a circle))

Answer 1

For example, there is GraphViz, a graph visualization program. You can use it, and besides, they have a large and informative website.
Website: www.graphviz.org
examples of work: www.graphviz.org/Gallery.php
description in Russian: www.portablecomponentsforall.com/edu/graphviz-about-ru
links to theory: www.graphviz.org/Theory.php
Wikipedia English: en.wikipedia.org/wiki/Graph_drawing
Wikipedia Russian: ru.wikipedia.org/wiki/%D0%92%D0%B8%D0%B7%D1%83%D0%...
I hope the links are in some the degrees will help.
By the way, there is a whole annual International Graph Visualization (organizers: graphdrawing.org), so the topic is very serious.