[sage-devel] [sage-4.8.alpha2] problem with cython

Dear all, The following code is working perfectly with sage-4.7.2 and sage-4.8.alpha0 but not with sage-4.8.alpha2. Some missing imports ? David. Source code (stored in file test.pyx) def blop(): return _blop_() cdef int _blop

[sage-devel] Re: problem with cython

Thank you for the solution. However, it raised questions about backward compatibility of cython... Best, David. On Nov 25, 7:54 am, Simon King wrote: > Hi David, > > On 25 Nov., 00:18, David Coudert wrote: > > > The following code is working perfectly with sage-4.7.2 a

[sage-devel] Re: Massive slowdown of graphs.RandomGNP()

With patch http://trac.sagemath.org/sage_trac/ticket/12362 we inadvertently changed default value of parameter ``fast`` from True to False. Sorry about that. Patch http://trac.sagemath.org/sage_trac/ticket/12888 put it back to True. Furthermore, it sets default method to ``Sage`` which is faster t

[sage-devel] Re: Fwd: [Sage] #13141: implement constructing the dual of a linear program

That would be great. We should also expose the values of the dual variables if one wants to do column generation (This is possible with Pulp, so it should also be in Sage). David. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email

[sage-devel] Re: How to enable openmp in sage?

Hello, I'm also unable to use openmp. I did the following: File setup.py: == from distutils.core import setup from distutils.extension import Extension from Cython.Distutils import build_ext ext_module = Extension( "test", ["test.pyx"], extra_

[sage-devel] Wanted: a reviewer for patch #13352

Hello, patch #13352 proposes to improve the running time of the bitset_len method by using fast methods for counting bits in 32 and 64 bits integers (popcount). It - adds file bitcount.pxi to sage/misc/. This file contains the functions fo

Re: [sage-devel] Re: Wanted: a reviewer for patch #13352

Le 9 août 2012 à 02:09, Volker Braun a écrit : > On Wednesday, August 8, 2012 7:54:09 PM UTC-4, David Coudert wrote: > The alternative would be to use functions __builtin_popcount() and > __builtin_popcountll(). They are extremely fast but they required to add flag > ``-mpopcnt`` o

[sage-devel] Small patch fixing bug needs review: #13362

The function build_flow_graph (called by the flow function of sage/graphs/generic_graph.py) contains a "g.set_edge_label(l)" instead of "g.set_edge_label(sp[i],sp[i+1],l)", where l is a number. This patch should be easy to reviewed. Thanks for your help, David. -- -- To post to this

[sage-devel] Re: Problems in the computation of hyperbolicity.

Dear Miguel, Memory is not the sole limitation here. The main problem is that the worst case time complexity is O(n^4). For instance, it took me several weeks of computation to determine the hyperbolicity of the latest CAIDA maps (2012 and 2013). There is currently no exact algorithm for comput

[sage-devel] Compilation error with linbox-1.4.2 during compilation of sage 7.4.beta4

Hello, I have the following error with linbox during the compilation of sage 7.4.beta4. > ./lb-domain-type.h:31:33: fatal error: linbox/field/givaro.h: No such file or directory I was successfully able to compile 7.3, 7.4.beta1 and 7.4.beta2 on the same computer. I tried a `make distclean` but

[sage-devel] Re: Compilation error with linbox-1.4.2 during compilation of sage 7.4.beta4

I saw that you have already put useful part of the log on the ticket. Thank you. Le lundi 12 septembre 2016 19:22:42 UTC+2, leif a écrit : > > > > Presumably works if you temporarily hide your MAPLE. > > (I'll put a note onto the upgrade ticket [1]; you could *attach* ;-) > your log there as wel

[sage-devel] Re: Sage's references: new policy?

What if we have two papers by "Author" and "Coauthor" in 2016? How to distinguish between a paper by say "R. Thomas" in 2000 and another by "C. Thomassen" in 2000 ? Le mercredi 21 septembre 2016 01:03:27 UTC+2, John H Palmieri a écrit : > > As discussed in another thread [1]_ on sage-devel recen

[sage-devel] Re: Testing new graph algorithms

Le mardi 11 octobre 2016 16:03:44 UTC+2, Travis Scrimshaw a écrit : > > > >>> Even if it does turn out that this technique performs worse than Sage on >>> some graphs, is it worth trying to integrate it as an option for users? >>> >> >> Are these algorithms published? (sorry, "Mark Bell" isn't v

[sage-devel] Re: Embedding graphs on the projective plane

I'll be happy to help reviewing a ticket on SPQR-trees. Definitively useful. An option could be to interface OGDF - Open Graph Drawing Framework (http://www.ogdf.net/). It has static and dynamic implementations of SPQRtrees, but it might be too challenging for a first contribution. David. Le mar

[sage-devel] Re: Lollipop vs. Barbell

Le mardi 29 novembre 2016 17:42:51 UTC+1, Peleg Michaeli a écrit : > > Dear list members, > > I was wondering what really makes the difference between the graph > generators in `basic.py` and those in `families.py`. > When we created the directory `generators` to split a big file with plenty o

[sage-devel] Re: GSoC 2017 kickoff

That's clearly something we need. If the student is good and fast, (s)he can also try to implement the split-decomposition which is a generalization of modular decomposition that can be computed in linear time (roughly finds complete bipartite graph separators). Also, we could consider adding e

[sage-devel] cannot recover password on ask.sagemath

Hello, I'm retrying to recover my password on http://ask.sagemath.org, but it's not working. When I put my email address in the box "Having trouble signing in?", the system indicate "Account recovery email sent", but I'm not receiving it. I tried many times. Any help is welcome. David. -- Yo

[sage-devel] Re: Bug in average_distance(), by_weight parameter is ignored

Right, the average_distance method calls the wiener_index method without passing the parameters. This is fixed in ticket #22885 https://trac.sagemath.org/ticket/22885 Le mercredi 26 avril 2017 13:11:03 UTC+2, Sebastian Smith a écrit : > > Hi, I ran across a bug in the graph.average_distance() fun

[sage-devel] Re: cannot recover password on ask.sagemath

> > On Friday, April 14, 2017 at 3:45:12 AM UTC-4, David Coudert wrote: >> >> Hello, >> >> I'm retrying to recover my password on http://ask.sagemath.org, but it's >> not working. >> When I put my email address in the box "Having trouble s

Re: [sage-devel] Re: cannot recover password on ask.sagemath

gt; I am on it, check your emails. > > Ciao, > Thierry > > >> Thanks. >> David. >> >> Le samedi 15 avril 2017 14:16:58 UTC+2, kcrisman a écrit : >>> >>> I've alerted the admins of ask.sagemath to see if we can figure out how to &g

[sage-devel] Why is absolute_import a method of designs ?

designs. shows absolute_import and we have sage: designs.absolute_import _Feature((2, 5, 0, 'alpha', 1), (3, 0, 0, 'alpha', 0), 16384) I don't understand what's going on. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this

Re: [sage-devel] Why is absolute_import a method of designs ?

So the problem is already addressed. solves the issue. Did you open a ticket? > No. Thank you. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsub

[sage-devel] Re: Second round poll for H5 a specific guideline for writing docstrings

A method like `Graph().is_bipartite(certificate=False)` returns either ``True``or ``False`` when ``certificate==False``, or a tuple `(bool, dict)` when ``certificate==True``. What would be the recommended writing style for the output block ? -- You received this message because you are subscr

[sage-devel] Re: inconsistency in docstring of MIP domain

Yes, please open a ticket to update the documentation (not done in https://trac.sagemath.org/ticket/19522). -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-d

[sage-devel] bug in calculus.limit reported in ask.sagemath

reported in https://ask.sagemath.org/question/37660/why-is-sage-calling-1-a-variable/ === sage: x = var('x') sage: f = 1/(x-3) sage: limit(f,x=3,dir='below') --- UnboundLocalError Trac

[sage-devel] make distclean fails

directory may contain configuration files and other potentially helpful information. WARNING: if you now run 'make' again, the build directory will, by default, be deleted. Set the environment variable SAGE_KEEP_BUILT_SPKGS to 'yes' to prevent this. make: *** [build-clean]

[sage-devel] Re: make distclean fails

Stop. ….. > Le 7 déc. 2015 à 18:46, Volker Braun a écrit : > > A workaround is "git clean -f -d -x" > > > On Monday, December 7, 2015 at 6:10:12 PM UTC+1, David Coudert wrote: > Hello, > > I’m having a serious issue to compile sage on OSX 10.9. > I did

Re: [sage-devel] Re: make distclean fails

On Monday, December 7, 2015 at 7:36:42 PM UTC+1, Jeroen Demeyer wrote: > > On 2015-12-07 19:33, David Coudert wrote: > > Unfortunately the problem remains. > > Which problem? Log please. > > I have updated my distribution from beta5 to beta7. Since, `make` and `

Re: [sage-devel] semantic of equality for Graph/Digraph

It's not a bug, it's how equality is defined (they have the same settings for loops, multiedges and weightedness). It's different from being isomorphic. def __eq__(self, other): """ Compare self and other for equality. Do not call this method directly. That is, for `

Re: [sage-devel] On (di)graph generation

Le mercredi 11 octobre 2017 16:36:07 UTC+2, Dima Pasechnik a écrit : > > > > On Wednesday, October 11, 2017 at 10:20:02 AM UTC+1, Jori Mäntysalo wrote: >> >> On Wed, 11 Oct 2017, David Joyner wrote: >> >> >> 1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a >> >> graph of 0 v

[sage-devel] Re: Graphs: Hamiltonian path vs. cycle

I took some more time to thought about the will of unifying these behaviors (which is a good idea) and I now believe it is not a good idea to use the same method / term to check if the graph has a hamiltonian cycle or a hamiltonian path. Doing so, we are making methods more complicated and int

Re: [sage-devel] Re: Graphs: Hamiltonian path vs. cycle

> It seems that "traceable graph" is more common (by googling), but then it > seems very natural to have is_eulerian/is_semi_eulerian and > is_hamiltonian/is_semi_hamiltonian. Opinions? > We can do that, but first we have to agree on the definitions for both eulerian/hamiltonian path/cycle,

Re: [sage-devel] Re: Graphs: Hamiltonian path vs. cycle

> But anyways, I found more. is_eulerian(path=True) will return either False OR > an Eulerian path. This seems to be clearly wrong. It is not a correct behavior. This method should have a parameter `certificate`, default to False. When certificate is True, it returns a pair boolean and certifi

[sage-devel] Re: [min_spanning_tree] It is not operating correctly

The issue is that the graph is not seen as weigthed by default. So either you provide a weight function, or you have to set the graph has weigthed. Then you get what you expect. sage: G = Graph([(0,1,78), (0,2,99), (0,5,20), (1,3,16), (1,6,68), (1,7,34), (2,4,43), (2,5,13), (3,4,70), (3,7,2), (

Re: [sage-devel] Build error

I tried some of the suggestions: 1) deleting SAGE_LOCAL/lib/libpython* and then make -> failed 2) make distclean && make build -> success I still have to add the optional packages I need, but it's working. Thanks. David. -- You received this message because you are subscribed to the Google Grou

[sage-devel] Re: GSoC 2018: mentor application and ideas list

I'm for sure too late, but an interesting contribution would be to extend the MIP backend to enable column generation. I don't know how to do it, and I remember that Nathann told me once that it might be difficult to do. David. Le lundi 22 janvier 2018 14:03:30 UTC+1, Stefan a écrit : > > We h

[sage-devel] error compiling package giac-1.4.9.45

I have a compilation error with package giac-1.4.9.45 during the compilation of SageMath version 8.2.beta4 on a linux computer (make build -j1).See attached log file.Any help is more than welcome.David. -- You received this message because you are subscribed to the Google Groups "sage-devel" gr

Re: [sage-devel] error compiling package giac-1.4.9.45

what is the smart way to do that (i.e., without make dist-clean) ? Le dimanche 28 janvier 2018 12:07:25 UTC+1, François Bissey a écrit : > > Rebuild gcc. see https://trac.sagemath.org/ticket/24599 > -- You received this message because you are subscribed to the Google Groups "sage-devel" group

Re: [sage-devel] error compiling package giac-1.4.9.45

Thanks. I have recompiled gcc.However, the compilation of giac is still failing :( See attached log.David. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-dev

Re: [sage-devel] error compiling package giac-1.4.9.45

I don’t know where to find this file. David. > Le 28 janv. 2018 à 19:48, François Bissey a écrit : > > OK after checks, it means it tries to link with libpng-1.2 rather than > a newer one like we have in sage now (1.6). Can you send the config.log > from giac? > > Françoi

Re: [sage-devel] error compiling package giac-1.4.9.45

cal/var/tmp/sage/build/giac-1.4.9.45/src/config.logif I am not mistaken.FrançoisOn 29/01/2018, at 08:59, David Coudert <david.coud...@inria.fr> wrote:I don’t know where to find this file.David.Le 28 janv. 2018 à 19:48, François Bissey <frp.bis...@gmail.com> a écrit :OK after checks, it

Re: [sage-devel] error compiling package giac-1.4.9.45

.16 -> libpng16.so.16.29.0 -rwxr-xr-x 1 dcoudert 908936 déc. 14 17:36 /home/dcoudert/sage/local/lib/libpng16.so.16.29.0 > Le 28 janv. 2018 à 22:29, François Bissey a écrit : > > What version of libpng is installed? Can you post the output of > ls -la /home/dcoudert/sage/local/lib/libp

Re: [sage-devel] error compiling package giac-1.4.9.45

/2018, at 12:11, David Coudert wrote: >> >> -rw-r--r-- 1 dcoudert 1689776 déc. 14 17:36 >> /home/dcoudert/sage/local/lib/libpng16.a >> lrwxrwxrwx 1 dcoudert 19 déc. 14 17:36 >> /home/dcoudert/sage/local/lib/libpng16.so -> libpng16.so.16.29.0 >>

[sage-devel] Re: hamiltonian_path() counter example

The main issue is that the hamiltonian path method calls the longest path method. We should provide a dedicated ILP for hamiltonian path that could optionally search for a hamiltonian path of minimum/maximum cost. Le mardi 6 février 2018 19:39:32 UTC+1, Dima Pasechnik a écrit : > > > > On Tue

[sage-devel] Re: Sagemath 8.2.beta7: issue compiling cbc

After distclean, it's now compiling. Thanks, David. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group

[sage-devel] 8.2.rc0 - banner change ?

I just started 8.2.rc0 in a terminal and observed a change in the banner. Is this an expected behavior or something goes wrong ? confetti:sage dcoudert$ ./sage ┌┐ │ SageMath version 8.2.beta8, Release Date: 2018-03-10

[sage-devel] 8.2.rc2 on OSX: compile gcc 7.2 after git pull

I just made a "git pull" to go from 8.2.rc1 to 8.2.rc2 on my OSX laptop, and "make" launches the compilation of gcc 7.2 ?!? I had to do a "make dist-clean" for 8.2.beta7, since my install missed the switch from gcc to clang on osx ( https://groups.google.com/forum/#!topic/sage-devel/xP7F5T350IQ)

[sage-devel] Re: 8.2.rc2 on OSX: compile gcc 7.2 after git pull

I will then try to get back to rc1. Thank you all. David. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this

[sage-devel] Re: Two-vertex graphs and is_prime()

A clique is a "series" module in the modular decomposition because its complement is not connected. See the survey https://arxiv.org/pdf/0912.1457 * A module is of type parallel if G is not connected but its complement it * A module is of type series if G is connected but its complement is not.

[sage-devel] 8.3.rc1: issue with sage banner

I just did a fresh install of sagemath (git clone …) and the starting banner is weird. I don’t know if it’s due to my system (recent update to fedora 28) or to recent changes in Sagemath. Any help to solve the issue is more than welcome ;) David. == musclotte:/home/dcoudert/sage> uname -a Li

[sage-devel] Re: 8.3.rc1: issue with sage banner

Fixed: I had to ensure that languages variables (LANGUAGES, LC_ALL, LANG) are well set. This was somehow done by default with previous versions of the system. Best, Le vendredi 20 juillet 2018 14:45:33 UTC+2, david@inria.fr a écrit : > > I just did a fresh install of sagemath (git clone …)

[sage-devel] issue with cos(pi/2) and sin(pi)

I looking for a smart way to fix the following issue that we have when plotting graphs (see #22050 and #24512 for instance): cos(pi/2) is not 0 and sin(pi) is not 0 ! sage: G = Graph(4) sage: _circle_embedding(G, G.vertices()) sage: G._pos {0: (1.0, 0.0), 1: (6.123233995736766e-17, 1.0), #

Re: [sage-devel] issue with cos(pi/2) and sin(pi)

d then recompile), I get , I will use round. It’s apparently the easiest solution. Best, > > Regards, > TB David Coudert Equipe-Projet COATI Centre de Recherche INRIA Sophia Antipolis - Méditerranée Université Côte d’Azur, Inria, CNRS, I3S, France http://www-sop.inria.fr/me

[sage-devel] Re: Py3, sorting vertices of graph

Comparisons like u < v are used in many places in the code of graphs. We can try to use hash(u) < hash(v) instead, but this is certainly not the smartest solution. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group

[sage-devel] Re: Py3, sorting vertices of graph

Le jeudi 6 septembre 2018 14:16:33 UTC+2, Martin R a écrit : > > Would it be hard to separate vertex labels and vertices? In other words, > vertices would always be 0,...,n-1, and there would be an additional array > containing the vertex labels. > Some graph backends do that, like `c_graph`. I'

Re: [sage-devel] Re: Py3, sorting vertices of graph

I'm working on reducing the number of places where we explicitly compare vertex labels. So far I'm focusing on MIPs. - #26274 : avoid comparison of vertex labels in MIP for file `graph_coloring.py` - #26282 : avoid comparison of vertex labels in MIP for file `graph.py` More to come,

Re: [sage-devel] Re: Py3, sorting vertices of graph

Two more: - #26284 : deals with comparability.pyx, digraph.py, vertex_separation.pyx, cutwidth.pyx and connectivity.pyx - #26285: avoid comparison of vertex labels in MIPs of generic_graph. Le vendredi 14 septembre 2018 13:43:37 UTC+2, David Coudert a écrit : > > I'm

Re: [sage-devel] Error compiling 8.5.beta3 - gsl-2.5

It's working ! Thank you. David. Le lundi 12 novembre 2018 10:35:06 UTC+1, Erik Bray a écrit : > > I have an idea of what might cause this and will submit a fix, but > just manually delete the existing file and try again. > On Mon, Nov 12, 2018 at 8:23 AM David Coudert > wr

[sage-devel] Re: git trac push error

On Sunday, January 25, 2015 at 1:48:42 PM UTC+1, Volker Braun wrote: > > Should be fixed now! > Thanks to what you did I have been able to push my commits, but now when I got to page http://trac.sagemath.org/ticket/17665 I get: Oops… *Trac detected an internal error:* OSError: Failed to ren

[sage-devel] Re: git trac push error

Thank you ! On Sunday, January 25, 2015 at 4:38:38 PM UTC+1, Volker Braun wrote: > > Ok, this should be fixed now as well. > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an

[sage-devel] Can I use boost in sage code

Hello, Since we now have all boost headers in a standard package, I would like to know if it is or not accepted to use boost code inside some sage code ? More specifically, can I use some algorithm from the BGL to speed-up some graph algorithms (if it is effectively the case). I have not tried

[sage-devel] Re: Can I use boost in sage code

So now I have to learn how to do it. Best, David. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group,

Re: [sage-devel] Re: GSoC 2015: 5 projects funded

On Tuesday, April 28, 2015 at 6:43:32 AM UTC+2, Vincent Knight wrote: > > Thanks for the hard work Harald and welcome to all the students! > +1 -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving

[sage-devel] Re: Broken links to doc already appearing

Hello, When I try to access http://www.sagemath.org/packages/upstream/ I get error 404 Furthermore, as soon as you are on that error page, the root dir is changed to http://www.sagemath.org/packages/upstream/ One side effect is that we are currently unable to download http://www.sagemath.org/

Re: [sage-devel] Failed to build cysignals-1.10.3 and pyzmq-22.2.1 on a Fedora 35 (x86_64)

I have the same issues after upgrade a desktop to fedora 35. I succeed to compile using https://trac.sagemath.org/ticket/32828 Thanks. On Monday, November 22, 2021 at 8:22:48 AM UTC+1 enriqu...@gmail.com wrote: > For cysignals it works using the package from this fork: > https://github.com/kliem

Re: [sage-devel] trac is not accessible now

> In the spam they are! First time I see this in more than 10 years! Thank > you. > I frequently have emails about sagemath in my spam folder and I have not find yet how to change the rules of gmail to avoid that. Best, David. -- You received this message because you are subscribed to the

[sage-devel] Re: Kruskal's Algorithm using Priority Queues

This query has been added in https://trac.sagemath.org/ticket/10433. I don't think that priority queue can be of any help to speed up the current code. On Sunday, April 10, 2022 at 11:03:41 AM UTC+2 adarsh.k...@gmail.com wrote: > Hi everyone, > > I was going through Sage's codebase, and I came a

[sage-devel] Re: Kruskal's Algorithm using Priority Queues

hat line should be removed right? It can be >> misleading to potential contributors >> >> On Monday, April 11, 2022 at 12:31:02 PM UTC+5:30 David Coudert wrote: >> >>> This query has been added in https://trac.sagemath.org/ticket/10433. >>> I don&#x

[sage-devel] Re: Kruskal's Algorithm using Priority Queues

e removed right? It can be >> misleading to potential contributors >> >> On Monday, April 11, 2022 at 12:31:02 PM UTC+5:30 David Coudert wrote: >> >>> This query has been added in https://trac.sagemath.org/ticket/10433. >>> I don't think that priority queue

[sage-devel] Re: Polling for pygments style for our future doc

+1 for sphinx I don't like the italic in tango. David. On Thursday, August 4, 2022 at 6:33:27 PM UTC+2 Eric Gourgoulhon wrote: > Thanks for preparing this poll. I vote for > > (1) tango > > Eric. > -- You received this message because you are subscribed to the Google Groups "sage-devel" gro

[sage-devel] Re: View issues

The command t.pdf() is not working for me for the following reason: Warning: `tkz-graph.sty` is not part of this computer's TeX installation. This package is required to render graphs in LaTeX. Visit 'https://www.ctan.org/pkg/tkz-graph'. Warning: `tkz-berge.sty` is not part of this computer's

[sage-devel] Re: New algorithm for graph edge coloring

Feel free to open a ticket for this code. It's seems a good improvement. On Sunday, November 27, 2022 at 5:39:34 PM UTC+1 Matheus Maldonado wrote: > Hello everyone, > > I just developed a new function for coloring graph edges based on > this article: > https://www.sciencedirect.com/science/arti

[sage-devel] Re: New algorithm for graph edge coloring

uot; option should be deleted. Instead, it >> would be nice to put this code into the documentation as an example that >> demonstrates how to print the colouring. >> > > Any specific reason for this? > > >> On Sunday, November 27, 2022 at 11:20:35 PM UTC-7 Da

Re: [sage-devel] Re: Voting: Block-scoped optional tag and the keyword

I vote for (A) On Friday, June 30, 2023 at 2:59:53 PM UTC+2 David Ayotte wrote: > I vote for (A) > > Le jeudi 29 juin 2023 à 18:47:42 UTC-4, Edgar Costa a écrit : > >> I vote for (A) >> >> On Thu, Jun 29, 2023 at 6:27 PM Marc Culler wrote: >> >>> I vote for (C). >>> >>> On Wednesday, June 28, 20

Re: [sage-devel] Should I report codepaths leading to comparing incomparable objects?

Thanks for reporting this issue. I have opened an issue (https://github.com/sagemath/sage/issues/35889) and will propose a fix asap. On Sunday, July 2, 2023 at 6:37:45 PM UTC+2 Georgi Guninski wrote: > You definitely can construct graph with incomparable vertices > and they worked as expected in

Re: [sage-devel] Graph([('A','B'),(1,2)]).edges() raises weird traceback

There is an active deprecation warning in method edges(). Parameter sort will be set to False in the future. I'm surprised you don't see it. sage: Graph([('A','B'),(1,2)]).edges() :1: DeprecationWarning: parameter 'sort' will be set to False by default in the future See https://github.com/sagema

[sage-devel] Re: grep-ing for sort() in graphs

Most of these calls are done on purpose and safe, but some may raise an error. > ./base/static_sparse_backend.pyx:512: vertices.sort() It's inside a try ... except... statement. We may certainly remove it in the future. > ./base/static_sparse_graph.pxd:10: void qsort(void *base, int nmemb, i

[sage-devel] Re: Exception in `G=Graph([("A",1)]);G.faces()`

I have opened https://github.com/sagemath/sage/issues/35902 to collect such kind of issues. Please use it to share new cases. On Wednesday, July 5, 2023 at 9:38:28 AM UTC+2 Georgi Guninski wrote: > Hi sage devs, your daily dose of incomparable objects, > fix 'em while they are free ;) > > G=Grap

Re: [sage-devel] Graph([('A','B'),(1,2)]).edges() raises weird traceback

and > ''> > > I think that either E is broken from start and an error should have > been raised in the first stage or everything is fine and we should > have a proper string representation. > > On Wed, 5 Jul 2023 at 08:33, David Coudert wrote: > > > > T

Re: [sage-devel] Graph([('A','B'),(1,2)]).edges() raises weird traceback

to review, help is more than welcome). Best, David. On Thursday, July 6, 2023 at 6:01:23 PM UTC+2 Nils Bruin wrote: > On Wednesday, 5 July 2023 at 21:54:03 UTC-7 David Coudert wrote: > > The current design choice in `EdgesView` is to sort only when asking for > the list of edges

[sage-devel] Bug in is_line_graph()

Bernard Lidicky reported me the following issue with method is_line_graph. I don't know how to fix that and I opened ticket https://trac.sagemath.org/ticket/29740 sage: g = Graph('O{e[{}^~z`MDZBZBkXzE^') sage: g.is_line_graph() ---

[sage-devel] Error with Pynac when building sage9.2.beta1

I have a compilation error with Pynac when trying building sage9.2.beta1 after a `make distclean`. See attached log file. It's on macOS mojave 10.14.6, and I have gmp installed by homebrew. Help is more than welcome ;) Thanks. David. -- You received this message because you are subscribed to

Re: [sage-devel] Re: Error with Pynac when building sage9.2.beta1

oogle.com/d/msgid/sage-devel/af53cb26-56b7-41b1-b03f-152285404186n%40googlegroups.com > > <https://groups.google.com/d/msgid/sage-devel/af53cb26-56b7-41b1-b03f-152285404186n%40googlegroups.com?utm_medium=email&utm_source=footer>. David Coudert Equipe-Projet COATI Ce

[sage-devel] 2 issues with 9.2.beta3

Hello, 1) To be able to compile the documentation of 9.2.beta2, I had to "export LANG=C.UTF-8 " See discussion here https://groups.google.com/forum/#!topic/sage-release/7wBxNRbJaaU But after "git pull" on develop branch to get 9.2.beta3, "make" fails quickly. It indicates that language relate

[sage-devel] Cplex installation (for beginners)

Hello, I'm posting this here as it may help improving the documentation of sage math and the install guide of Cplex. A colleague (with very little system knowledge) just installed sagemath on his new macOS laptop using the precompiled binary sage-9.1-OSX_10.15.4-x86_64.app.dmg. He also instal

Re: [sage-devel] Cplex installation (for beginners)

>> sage -i openssl >> sage -f python3 >> >> and then you should be able to add packages through pip. >> > > I would be surprised if this works on > a machine without Xcode installed. > > >> On Wednesday, August 26, 2020 at 12:23:20 PM UTC-4

[sage-devel] Re: Cplex installation (for beginners)

repared as an optional sage package. > "sage -i sage_numerical_backends_cplex" suffices. See > https://doc.sagemath.org/html/en/thematic_tutorials/linear_programming.html#solvers-backends > > > On Wednesday, August 26, 2020 at 9:10:33 AM UTC-7, David Coudert wrote: >>

[sage-devel] Re: Cplex installation (for beginners)

Perfect. Thank you. Le jeudi 27 août 2020 à 17:00:14 UTC+2, Matthias Koeppe a écrit : > On Thursday, August 27, 2020 at 4:44:07 AM UTC-7, David Coudert wrote: >> >> "sage -i sage_numerical_backends_cplex" is working well. Thank you. >> >> May be we sh

[sage-devel] Need help in English, French, German, Japanese and Portuguese for 30212

Ticket https://trac.sagemath.org/ticket/30212 touches tutorials in English, French, German, Japanese, Portuguese. We need reviewers for each of these languages. I did tentative translations in German and Portuguese, but not in Japanese. Thank you, David. -- You received this message because you

Re: [sage-devel] Need help in English, French, German, Japanese and Portuguese for 30212

anyone around you able to do the Japanese translation ? it's 2 lines... Le lundi 31 août 2020 à 12:41:37 UTC+2, hel...@potuz.net a écrit : > > > On August 31, 2020 7:10:35 AM GMT-03:00, David Coudert < > david@gmail.com> wrote: > >Ticket https://trac.sage

[sage-devel] Re: LOTS of tickets waiting for review

Anyone able to review #11736? It's a truly linear time implementation of Lex BFS. I spent some time on the original paper to fully understand the algorithm (not well described) and find the issues in the original code. Le lundi 31 août 2020 à 19:05:13 UTC+2, Matthias Koeppe a écrit : > On Satu

Re: [sage-devel] Changes to bitset.pxi

Most of the bitsets used in the graph backend are to record sets of seen or active vertices. These sets are not sparse. But I think we have several places in the graph module where we use sets instead of bitsets for small number of vertices. Sparse bitsets could be useful in this case if effecti

[sage-devel] error while installing python_igraph on fedora 32 - missing texttable

I just installed sagemath on a new desktop running fedora 32 and I'm now trying to install python_igraph. Command 'sage -I python_igraph' failed because it is unable to download dependency texttable-1.6.3.tar.gz (log file attached) It tries to download it from mirrors (where it is not present) a

Re: [sage-devel] error while installing python_igraph on fedora 32 - missing texttable

Thank you ! +1 to make it default, in particular since it's the last place it tries to download from. Le mercredi 9 décembre 2020 à 12:21:13 UTC+1, dim...@gmail.com a écrit : > On Wed, Dec 9, 2020 at 11:16 AM David Coudert wrote: > > > > I just installed sagemath on a

[sage-devel] Re: How to compile sparse graph backend with c++

I have not tried yet, but isn't it due to the fact that some parts are compiled with C and others with C++ ? Le lundi 11 janvier 2021 à 11:28:47 UTC+1, jonatha...@googlemail.com a écrit : > Super weird. I think it is a cython bug, but I'm not sure. > > The problem seems to be that the parent cl

Re: [sage-devel] Re: [GSoC Mentors Announce] Now Accepting GSoC 2021 Mentoring Organization Applications until Feb 19

I'll be happy to mentor a good student, but would prefer not to be admin. I already have a huge load of administrative work daily and would appreciate not to have extra. Le jeudi 4 février 2021 à 15:21:06 UTC+1, dim...@gmail.com a écrit : > On Thu, Feb 4, 2021 at 3:32 AM 'Travis Scrimshaw' via s

[sage-devel] Re: [GSoC Mentors Announce] Now Accepting GSoC 2021 Mentoring Organization Applications until Feb 19

This year is difficult for all of us and we lack motivation for this edition of GSoC. On the other end, it is more important than ever to push/motivate/help students. Other Sagemath contributors than the usual could be involved in mentoring activity. I think many contributors are not really awa

[sage-devel] issues building pdf documentation: missing encoding file 2004-H

Hello, I'm trying to build the pdf documentation (make doc-pdf) on a desktop with fedora-33. I'm currently having hard time with the Japanese version of a_tour_of_sage. I'm discovering one after the other the missing packages for latex. Currently, I'm blocked with the following error: dvipdfmx:

Re: [sage-devel] issues building pdf documentation: missing encoding file 2004-H

After installation of texlive-scheme-full, it's finally working. Thank you Dima. Le samedi 13 février 2021 à 16:10:36 UTC+1, dim...@gmail.com a écrit : > > > On Sat, 13 Feb 2021, 15:02 David Coudert, wrote: > >> Hello, >> >> I'm trying to build the pdf d

Re: [sage-devel] Re: Sage GSoC 2021 Projects

I added a project for improving the graph drawing methods we have. Le mercredi 24 février 2021 à 02:09:46 UTC+1, Travis Scrimshaw a écrit : > Thank you everyone who has added some projects. > > Even if someone has a project later on they want to add, please do so. We > can continue to add proje

  1   2   >