Friam

Simple Graph Drawing Algorithm?

Classic

List

Threaded

7 messages Options

Owen Densmore

Simple Graph Drawing Algorithm?

Administrator

Does anyone know of a fairly simple graph drawing algorithm that
will take a set of nodes and edges and produce a set of x,y values
for the nodes that creates a fairly "clean" graph? .. i.e. w/
the least mess? Criterion could be minimize edge crossings
and edge lengths, for example.

Owen Densmore 908 Camino Santander Santa Fe, NM 87505
[hidden email] Cell: 505-570-0168 Home: 505-988-3787
AIM:owendensmore http://complexityworkshop.com http://backspaces.net

Richard Harris-5

Simple Graph Drawing Algorithm?

I've used a thing called Graphviz, which is good at producing .ps files. I
don't think its current anymore, but it works niceley, especially on .

http://www.research.att.com/sw/tools/graphviz/

Within Java, I'm not sure, outside of some proprietary stuff from Thom
Sawyer, and ILOG. Of course, theres the force directed, or spring, graph
layout demos in the standard JDK's. Steve and Dan have done some cool things
in shockwave too.

Good luck,

Rich

----- Original Message -----
From: "Owen Densmore" <[hidden email]>
To: <[hidden email]>
Sent: Friday, November 28, 2003 11:18 AM
Subject: [FRIAM] Simple Graph Drawing Algorithm?

> Does anyone know of a fairly simple graph drawing algorithm that
> will take a set of nodes and edges and produce a set of x,y values
> for the nodes that creates a fairly "clean" graph? .. i.e. w/
> the least mess? Criterion could be minimize edge crossings
> and edge lengths, for example.
>
> Owen Densmore 908 Camino Santander Santa Fe, NM 87505
> [hidden email] Cell: 505-570-0168 Home: 505-988-3787
> AIM:owendensmore http://complexityworkshop.com http://backspaces.net
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9AM @ Jane's Cafe
> Lecture schedule, archives, unsubscribe, etc.:
> http://www.friam.org
>
>

Roger Critchlow-2

Simple Graph Drawing Algorithm?

In reply to this post by Owen Densmore

What do you know, you missed the annual graph drawing convention in
Perugia this September. This link is the current hit for the graph
drawing bibliography at Brown University.

http://www.cs.brown.edu/people/rt/gd.html

-- rec --

Owen Densmore wrote:

Owen Densmore

Simple Graph Drawing Algorithm?

Administrator

In reply to this post by Richard Harris-5

On Friday, November 28, 2003, at 09:29 AM, Richard Harris wrote:

> I've used a thing called Graphviz, which is good at producing .ps
> files. I
> don't think its current anymore, but it works niceley, especially on .
>
> http://www.research.att.com/sw/tools/graphviz/

I used GraphVis during my power law study:
http://backspaces.net/PLaw/index.html
For example, click on any of the graph links in the index:
http://backspaces.net/PLaw/html/index.html
such as:
http://backspaces.net/PLaw/html/graphs-TdS+.html

> Within Java, I'm not sure, outside of some proprietary stuff from Thom
> Sawyer, and ILOG. Of course, theres the force directed, or spring,
> graph
> layout demos in the standard JDK's. Steve and Dan have done some cool
> things
> in shockwave too.

I'll let you know if I find anything.

Owen

> Good luck,
>
> Rich
>
> ----- Original Message -----
> From: "Owen Densmore" <[hidden email]>
> To: <[hidden email]>
> Sent: Friday, November 28, 2003 11:18 AM
> Subject: [FRIAM] Simple Graph Drawing Algorithm?
>
>
>> Does anyone know of a fairly simple graph drawing algorithm that
>> will take a set of nodes and edges and produce a set of x,y values
>> for the nodes that creates a fairly "clean" graph? .. i.e. w/
>> the least mess? Criterion could be minimize edge crossings
>> and edge lengths, for example.
>>
>> Owen Densmore 908 Camino Santander Santa Fe, NM 87505
>> [hidden email] Cell: 505-570-0168 Home: 505-988-3787
>> AIM:owendensmore http://complexityworkshop.com
>> http://backspaces.net
>>
>>
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9AM @ Jane's Cafe
>> Lecture schedule, archives, unsubscribe, etc.:
>> http://www.friam.org
>>
>>
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9AM @ Jane's Cafe
> Lecture schedule, archives, unsubscribe, etc.:
> http://www.friam.org
>

Owen Densmore 908 Camino Santander Santa Fe, NM 87505
[hidden email] Cell: 505-570-0168 Home: 505-988-3787
AIM:owendensmore http://complexityworkshop.com http://backspaces.net

Owen Densmore

Simple Graph Drawing Algorithm?

Administrator

In reply to this post by Roger Critchlow-2

On Friday, November 28, 2003, at 09:31 AM, Roger E Critchlow Jr wrote:

> What do you know, you missed the annual graph drawing convention in
> Perugia this September.

This is so weird! I was in Perugia around that date! Love
the town. Dede and I were slightly south of Perugia in Todi
taking an Italian language class.

Owen

> This link is the current hit for the graph
> drawing bibliography at Brown University.
>
> http://www.cs.brown.edu/people/rt/gd.html
>
> -- rec --
>
> Owen Densmore wrote:
>
>> Does anyone know of a fairly simple graph drawing algorithm that
>> will take a set of nodes and edges and produce a set of x,y values
>> for the nodes that creates a fairly "clean" graph? .. i.e. w/
>> the least mess? Criterion could be minimize edge crossings
>> and edge lengths, for example.
>>
>> Owen Densmore 908 Camino Santander Santa Fe, NM 87505
>> [hidden email] Cell: 505-570-0168 Home: 505-988-3787
>> AIM:owendensmore http://complexityworkshop.com
>> http://backspaces.net
>>
>>
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9AM @ Jane's Cafe
>> Lecture schedule, archives, unsubscribe, etc.:
>> http://www.friam.org
>>
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9AM @ Jane's Cafe
> Lecture schedule, archives, unsubscribe, etc.:
> http://www.friam.org
>

Owen Densmore 908 Camino Santander Santa Fe, NM 87505
[hidden email] Cell: 505-570-0168 Home: 505-988-3787
AIM:owendensmore http://complexityworkshop.com http://backspaces.net

Parks, Raymond

Simple Graph Drawing Algorithm?

In reply to this post by Owen Densmore

Owen Densmore wrote:

> Does anyone know of a fairly simple graph drawing algorithm that
> will take a set of nodes and edges and produce a set of x,y values
> for the nodes that creates a fairly "clean" graph? .. i.e. w/
> the least mess? Criterion could be minimize edge crossings
> and edge lengths, for example.

The tools guy here at Sandia has had success with jgraph
<http://www.jgraph.com/>. He says that after one gets over the initial
learning curve (which isn't all that bad), it works very well. The
tools in which he has used it include an attack diagram analysis tool
with boxes for attack steps and lines joining the boxes and a network
discovery tool in which boxes represent network nodes and lines the
routes between them. In the case of the network discovery tool, he
added an algorithm to give every node a repelling "charge" in order to
get the final diagram to shove things around until the diagram is
usable. I believe the layout algorithm came with jgraph.

Ray Parks

Fred Seibel

Simple Graph Drawing Algorithm?

In reply to this post by Owen Densmore

Just came across this site. Very interesting behavior for a graph
drawer.
http://www.touchgraph.com

Fred
On Nov 28, 2003, at 9:18 AM, Owen Densmore wrote: