On Wednesday, March 29, 2017 at 10:46:56 AM UTC-7, Michael Torrie wrote:
> On 03/29/2017 11:17 AM, j...@itu.edu wrote:
> > On Wednesday, March 29, 2017 at 1:23:48 AM UTC-7, arpitam...@gmail.com
> > wrote:
> >> Hi
> >> I am planning to tweak the Kernighan Lin algorithm a bit use coercing of
> >> certain vertices .I was wondering if u would be kind enough to share the
> >> python code with me so that i can include my idea in it.
> >
> > Good luck getting the code you want from Dean Hall, his post is from 1999!
> >
> > (Is 18 years a record for thread necromancy?)
>
> I don't see any reply to a post from 1998 here... What post are you
> talking about?
The Google Groups interface shows that the first post in this thread is as
follows:
> From: dwh...@ksu.edu (Dean Hall)
> Subject: K&L graph partitioning code offer
> Date: 1999/03/01
> Message-ID: <7bftca$l...@abc.ksu.ksu.edu>#1/1
> X-Deja-AN: 450257007
> Summary: K&L two-way partitioning algorithm coded in Python
> X-Complaints-To: ab...@ksu.edu
> X-Trace: cnn.ksu.ksu.edu 920352972 10308 129.130.12.3 (2 Mar 1999 05:36:12
> GMT)
> Organization: Kansas State University
> Keywords: graph theory partition Kernighan Lin K&L
> NNTP-Posting-Date: 2 Mar 1999 05:36:12 GMT
> Newsgroups: comp.lang.python
>
> Hello,
>
> If anyone is interested in the Kernighan & Lin partitioning algorithm,
> I've coded it in Python.
> For those that don't know, the K&L algorithm finds a
> pair of partitions of a set that has the locally minimum
> number of edges between the two partitions (cutsize).
>
> I implemented a dumb Graph class (vertices and egdes),
> then a KLPartitioner class.
> Then, for fun ('cuz that's what Python is),
> I wrote a class that uses Tkinter to display the resulting graph.
>
> I don't read the newsgroups much,
> so email me if you wanna see the code.
>
>
> !!Dean
> dwh...@ksu.edu
--
https://mail.python.org/mailman/listinfo/python-list
