Subject: [ferari-dev] [HG] now I have spiffy (roughly) O(n log n)

From: FErari <[email-masked]>
Date: Wed, 05 Apr 2006 22:30:24 +0200

One or more new changesets pushed to the primary FErari repository.
A short summary of the last three changesets is included below.

changeset:   11:ea597155d4bcc834d5d6e42c922cb2c8d747ac27
tag:         tip
user:        "Robert C. Kirby <[email-masked]>"
date:        Wed Apr  5 22:30:08 2006 -0500
files:       FErari/binary.py
description:
now I have spiffy (roughly) O(n log n)
algorithm for building the sparse graph
in binary optimization

changeset:   10:ece0423341efc9ef415e557520a9b47325f952d7
user:        "Robert C. Kirby <[email-masked]>"
date:        Tue Apr  4 23:58:34 2006 -0500
files:       FErari/binary.py FErari/pg.py TODO
description:
worked more on doing O(n log(n)) formation of sparse
graph in binary optimization

changeset:   9:f9c9ca8a93a30c81ff0fe222860b12dae00f4073
user:        "Robert C. Kirby <[email-masked]>"
date:        Mon Apr  3 21:22:46 2006 -0500
files:       CHANGE setup.py
description:
change setup.py for 0.0.2

----------------------------------------------------
For more details, visit http://www.fenics.org/hg/ferari