So, I set export SAGE_CHECK=no but the same checks went into play
and failed. Then I unset SAGE_CHECK variable and the build goes
through. I still have to do make test.
I don't know why the checks don't work for package python, but if I
could make a suggestion maybe it would be better that the
Fix for the SAGE_CHECK issue is in
http://trac.sagemath.org/sage_trac/ticket/9960 and needs review.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group
thnx for your answers.
I'm dealing with an undirectred graph. In the beginning I have a given
number of vertices (53 in my case now) and a list or relations between
them. All I do is adding a new edge (a - b) if a is in relatoin to be.
My problem is, i dont know form the beginning if it's
I just checked the shortes_path method and it wents many times faster. thnx.
Am 05.02.2011 08:08, schrieb Nathann Cohen:
Of course finding the shortest path may be (almost) as expensive as
finding all of them... If you're doing this for a lot of edges you
might want to break it up into
I did build, and it took some time... see the other thread
https://groups.google.com/group/sage-support/browse_thread/thread/eae8601ea024fbee
Now this example works. Thanks for the help.
On 3 velj, 21:11, Harald Schilly harald.schi...@gmail.com wrote:
Voker's example also works for me with 4.6
make test went fine
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
Sorry, I didn't get the beginning of the thread, but if you need the graph
without loops, it is a tree. So, you can compute a maximal spanning tree of
the graph, and see if you get the whole graph together. This will also tell
you what edges to remove, if the graph is not a tree. Of course, the
Oh, I was imprecise. If it has no loops, it is a forest. So you have to get
a spanning tree for each component.
On Sat, Feb 5, 2011 at 10:01 AM, Luiz Felipe Martins
luizfelipe.mart...@gmail.com wrote:
Sorry, I didn't get the beginning of the thread, but if you need the graph
without loops, it
Again...
Look at diff code by differentiate??, You read at the end of the file
that sage call derivative.
Search in x.derivative?? , there is a methode x._derivative??
I feel that only sage manages the rewrite rules in diff.
Now browse into taylor?? source, and you see that sage call the
Now browse into taylor?? source, and you see that sage call the taylor
function in maxima.
The taylor function in maxima seems very long to follow in
...maxima.../src/hayat.lisp.
More to the point, Maxima doesn't know about any 'special' things you
define like that. Our basic
Hello all. I would like to inform you of an issue I'm having with
SageTeX's sageplot functionality, and I'm hoping you can help me
resolve the issue. This is my first time posting in sage-support, let
alone in any Google group or newsgroup-like setting. Hopefully I'm
doing this right. :)
When
On 5 February 2011 08:17, Mate Kosor mate.ko...@gmail.com wrote:
I don't know why the checks don't work for package python, but if I
could make a suggestion maybe it would be better that the check ships
that package because now the check is nonfunctional.
IMHO that would be a bad idea. It's
On Sunday, February 6, 2011 7:19:29 AM UTC, Dr. David Kirkby wrote:
On 5 February 2011 08:17, Mate Kosor mate@gmail.com wrote:
I don't know why the checks don't work for package python, but if I
could make a suggestion maybe it would be better that the check ships
that package because
13 matches
Mail list logo
