Hello all,
Wanted to leave this note for anybody running into gcc8 compiling issues.
This was built on archlinux using their gcc 8.1.0-1 package. Fortunately
there are fixes floating around, please see attached patches.
- Python-2.7.14
Error (sorry for the lack of details, lost the log file:-/
Using some other definition of Change (ratio of 2017 sloc vs 2011 sloc,
whenever defined).
*Directory 2011 2017 Change*
server 12093 1 0.000
gsl 3919 83 0.021
ext 7260 346 0.048
matrix
Was it reported to GLPK?
>
> On 19/08/2017 20:15, fidelbc wrote:
> > Hello All,
> >
> > Seems like the `fractional_chromatic_index` method for graphs contains a
> > bug.
> >
> > The implementation contains an infinite loop that is broken when a
> q
Hello All,
Seems like the `fractional_chromatic_index` method for graphs contains a
bug.
The implementation contains an infinite loop that is broken when a quantity
is less than or equal to 1, however the loop never ends on the following
input:
sage: g=graphs.PetersenGraph()
sage: g.fractiona
Hello all,
A question [1] at the CoCalc group is related to the following issue while
plotting a polyhedron.
If a polyhedron P that is "far" from the origin is constructed, then
P.plot() displays the origin. Thus making the actual polyhedron relatively
small, see [2] for an example.
The culpr
Hello leif,
I'm using gcc 5.2.0 under ArchLinux. Issues with ncurses and gf2x remain.
I've created and tested a patch (attached) to extend some of the existing
fixes for gcc 5.0 and 5.1.
A post at sage-support [1] might also be relevant.
Best,
Fidel
[1]: https://groups.google.com/d/topic/sage
Hello Everyone,
Hope this is the right group to ask this. There is something I miss from
the sage notebook at cloud.sagemath: the graph_editor.
Does anybody know if there is any such feature being planned for
cloud.sagemath?
I'd be happy to contribute some code for this. How hard is it to cont
Hello all,
I was trying to answer a question on ask sage and I might have ran
into a bug.
http://ask.sagemath.org/question/1308/get_minmax_data-too-generosous
The following statements work with no problem:
sage: f(x) = sin(x)
sage: find_minimum_on_interval(f,0,1)
(6.5078162602101728e-09, 6.5078
Here it is, ticket number 12155.
http://trac.sagemath.org/sage_trac/ticket/12155
> Yes, it would appear that the generic complement() method is adding
> edges to a bipartite graph object and the error is coming from the
> bipartite graph routines complaining about an illegitimate edge. I
> would
Hi all,
I'm running sage 4.7.2. While trying the matching polynomial function
for graphs I found the following
sage: g=graphs.CompleteBipartiteGraph(3,3)
sage: g.matching_polynomial()
...
RuntimeError: Edge vertices must lie in different partitions.
After reading the documentation I tried
sage:
10 matches
Mail list logo
