The very idea is to go through the list of all tables, draw these tables in the form of squares and honey tables (squares) draw links in the case of foreign keys, so that these links do not overlap visually with other tables (squares).

  • Maybe it's not an algorithm, but a program? The algorithm will be expensive, and a lot of combinations 1-language (c ++ / c # / java ...) 2-image format (doc / wmf / pdf / svg) 3-provider access to the database via (ole / odbc / jdbc / navive / ....) - nick_n_a
  • @nick_n_a is an algorithm, I think it should be somewhere on the Internet, an algorithm for such a thing is described, it's just not quite clear how to formulate a request :) - plesser

1 answer 1

Here is an example of one of the simplest methods for this task.

  1. Get the list of tables.
  2. Draw them (squares) along the circle.
  3. Draw the connections between them.

With this approach, the relationships between the tables will not cross other tables (squares).

Other methods can also be searched on the Internet using the key queries " Graph Visualization " and "Graph Drawing Algorithm".

  • one
    Thanks, with the garbage circle can come out if you need to build a connection between the nodes located through one. But this is if I want a direct connection. But I did not think that it is possible to draw a crooked connection. I will think. Thanks again - plesser