Michael, check your email.
Robert, I wish I could say I was doing research, but the truth is I
was trying (successfully) to solve
http://projecteuler.net/index.php?section=problems&id=215
or maybe http://projecteuler.net/index.php?section=problems&id=244.
Both can be attacked by graph theory mea
Rado,
First of all, thank you for your improvement!
> I was playing with some big(10^6) graphs and noticed SAGE cannot
> handle constructing them in good time.
I am wondering, what in particular you are using Sage graphs for?
Graphs in Sage are currently in a transition period. Some things are
Since no one seemed to have dealt with this: This is now #6066 so the
patch doesn't get lost.
Cheers,
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr.
On May 14, 8:01 pm, Rado wrote:
Hi Rado,
> here is the patch as promised. I don't have a trac account and it
> seems closed, so someone needs to paste it there.
Follow http://wiki.sagemath.org/TracGuidelines and I will take care of
your account.
> http://www.math.uiuc.edu/~rkirov2/sage/1180
here is the patch as promised. I don't have a trac account and it
seems closed, so someone needs to paste it there.
http://www.math.uiuc.edu/~rkirov2/sage/11804.patch
Rado
On May 14, 7:12 am, Jason Grout wrote:
> Rado wrote:
> > alright, all tests passed. I will post the patch here tomorrow (i
Rado wrote:
> alright, all tests passed. I will post the patch here tomorrow (its
> only two lines). Thanks for the explanations, now I understand what's
> the symlink for :)
and thanks for catching this and tracking down the fix!
Jason
--~--~-~--~~~---~--~~
To
alright, all tests passed. I will post the patch here tomorrow (its
only two lines). Thanks for the explanations, now I understand what's
the symlink for :)
Rado
On May 14, 3:39 am, mabshoff wrote:
> On May 14, 1:32 am, Robert Bradshaw
> wrote:
>
> > On May 14, 2009, at 1:18 AM, Rado wrote:
>
On May 14, 1:32 am, Robert Bradshaw
wrote:
> On May 14, 2009, at 1:18 AM, Rado wrote:
>
> > Last question if I used ./sage -clone myvrr and made the changes in
> > myver, how do I tell sage to run the tests there (if this even makes
> > sense?)
>
> You can do
>
> ./sage -t devel/sage-myvrr/sage
On May 14, 2009, at 1:18 AM, Rado wrote:
> Last question if I used ./sage -clone myvrr and made the changes in
> myver, how do I tell sage to run the tests there (if this even makes
> sense?)
You can do
./sage -t devel/sage-myvrr/sage/graphs/... # or -tp 10
- Robert
>
> Rado
>
> On May 14, 3
Last question if I used ./sage -clone myvrr and made the changes in
myver, how do I tell sage to run the tests there (if this even makes
sense?)
Rado
On May 14, 3:13 am, mabshoff wrote:
> On May 14, 1:08 am, Rado wrote:
>
> > The bug is almost trivial. The code
>
> > verts = data.keys()
> > ..
On May 14, 1:08 am, Rado wrote:
> The bug is almost trivial. The code
>
> verts = data.keys()
>
> for u in data:
> verts.union([v for v in data[u] if v not in verts])
>
> is slowing down because in python searching in lists is slow. If we
> use "verts = set(data.keys())" the code speeds
The bug is almost trivial. The code
verts = data.keys()
for u in data:
verts.union([v for v in data[u] if v not in verts])
is slowing down because in python searching in lists is slow. If we
use "verts = set(data.keys())" the code speeds up tremendously.
sage: D={}
sage: for i in xrange
On Sun, May 10, 2009 at 10:18 AM, Rado wrote:
>
> I was playing with some big(10^6) graphs and noticed SAGE cannot
> handle constructing them in good time. However, networkx does just
> fine. Before I dive into the code, is this a feature (i.e. sage graph
> object has richer data and methods avai
13 matches
Mail list logo
