directed graphs? - lack of experience

From: Andreas Thiele
Subject: directed graphs? - lack of experience
Date: Sun, 25 May 2008 13:03:14 +0000
Message-ID: <g1bo36$ubl$03$1@news.t-online.com>

Hi all,

I must admit, I have a certain lack of experience. I need some operations on a directed graph. Specifically the graph shall represent the relations within a relational db model. I need to be able to sort the graph or/and find longest pathes. I try to write a program which allows automated cascading deletes in the database but probably with additional control possibilities.

Can anybody point me to some reading (preferably succint) or give some example how such a 'mesh' can or should be represented in Lisp?


Thanks in advance

Andreas

Re: directed graphs? - lack of experience Andreas Thiele
- Re: directed graphs? - lack of experience ··················@gmail.com
Re: directed graphs? - lack of experience ·······@eurogaran.com

From: Andreas Thiele
Subject: Re: directed graphs? - lack of experience
Date: Sun, 25 May 2008 14:59:25 +0000
Message-ID: <g1but2$3lh$01$1@news.t-online.com>

Andreas Thiele wrote:
> Hi all,
> 
> I must admit, I have a certain lack of experience. I need some operations on a directed graph. Specifically the graph shall
> represent the relations within a relational db model. I need to be able to sort the graph or/and find longest pathes. I try to
> write a program which allows automated cascading deletes in the database but probably with additional control possibilities.  
> 
> Can anybody point me to some reading (preferably succint) or give some example how such a 'mesh' can or should be represented in
> Lisp? 
> 
> 
> Thanks in advance
> 
> Andreas

Sorry for wasting your time folks,

sometimes you can't see the forrest for the tree.

I already have a representation in my DSL.

I just had to write a nice function to walk the graph.


Andreas

From: ··················@gmail.com
Subject: Re: directed graphs? - lack of experience
Date: Mon, 26 May 2008 07:24:52 +0000
Message-ID: <232346e9-67a4-4ad9-8ffe-a6b241dcd753@25g2000hsx.googlegroups.com>

Additionally (for next graph programs), I would suggest cl-graph.
Found it really useful, although documentation could be better.

Antonis

From: ·······@eurogaran.com
Subject: Re: directed graphs? - lack of experience
Date: Mon, 26 May 2008 15:42:56 +0000
Message-ID: <3d570e4a-e690-40cd-8b95-1564ee871c4c@r66g2000hsg.googlegroups.com>

> I must admit, I have a certain lack of experience. I need some operations on a directed graph. Specifically the graph shall represent the relations within a relational db model. I need to be able to sort the graph or/and find longest pathes. I try to write a program which allows automated cascading deletes in the database but probably with additional control possibilities.
>
The most amazing papers on the matter are by Hendrickson & Toczko
(based on Milan Randic work): If you simply maximize the graph's
connectivity matrix, chances are that those circuits appear at the
beginning or end of the resulting maximized/minimized matrix.
Quick and clean.
Another very interesting paper is due to Dr.Sussenguth. Don't have the
references here, though.