Re: Drawing graphs



Verne wrote:
Hello,

I am searching for some algorithms that will allow me to generate
graphic representation of graph.
I know that there should be some algorithm that includes gravity and
some springs or something similar.
If anybody could possibly point me where can I find information about
this kind of algorithm (as a matter of fact name would be enough
because I cannot find out how they call this algorith in english).
Thanks in advance for help.

W.

'Graph drawing' is the term for the problem in general.

'Force directed layout' is a common term for the spring-based algorithms.

'Sugiyama' layout is one of the (old) standard algorithms, but I think only part of it was force-directed. Other parts were used to minimise edge-crossings, etc.

Cheers,
Joe

Disclaimer: I'm about 10 years out of date in my knowledge of the field.
.



Relevant Pages

  • Re: Standard graph API?
    ... How would the algorithms work without a standard API? ... [code generating template example snipped] ... Well -- I was rather aiming for a definition of a graph protocol ...
    (comp.lang.python)
  • Re: Shortest path algorithm in digraph with multiple goals?
    ... > lot of red edges (thus your solution will produce a huge graph). ... graph traversal algorithms. ... arcs" can occur in any cycle. ... which there have been 'k' previous traversals of the "counted" arcs. ...
    (comp.programming)
  • Re: Shortest path algorithm in digraph with multiple goals?
    ... > lot of red edges (thus your solution will produce a huge graph). ... graph traversal algorithms. ... arcs" can occur in any cycle. ... which there have been 'k' previous traversals of the "counted" arcs. ...
    (comp.theory)
  • Re: Next Generation of Language
    ... |>> algorithms are graph based and have to search a tree. ... |>> graph algorithms are inherently unparallelizable. ... | over any number of cores (supposing one doesn't care about exact DFS ...
    (comp.lang.lisp)
  • Re: Linear programming vs. Graph Algorithms
    ... > algorithms much faster than using the standard Simplex method. ... You could always just take any standard graph problem for which you know ... Linear Program, the graph problem is often efficiently solvable. ...
    (comp.theory)