giacpy 0.6.7
Publié : dim. sept. 23, 2018 7:50 pm
giacpy 0.6.7 has been uploaded to Pypi.
should work.
the source, it is just an update of keywords to giac-1.5.0-3.
windows binaries for python 2.7, 3.4, 3.5, 3.6, 3.7 (32bits and 64bits) are built (in particular they are built with gsl, mpfr, pari, NTL, glpk, nauty)
NB: in giacpy, the python strings are evaluated by the giac library, so if you need to obtain a giac string you must use: '"my giac string"'
Ex;
to do in xcas:
in giacpy it gives:
Code : Tout sélectionner
python -mpip install --upgrade giacpy
the source, it is just an update of keywords to giac-1.5.0-3.
windows binaries for python 2.7, 3.4, 3.5, 3.6, 3.7 (32bits and 64bits) are built (in particular they are built with gsl, mpfr, pari, NTL, glpk, nauty)
NB: in giacpy, the python strings are evaluated by the giac library, so if you need to obtain a giac string you must use: '"my giac string"'
Ex;
to do in xcas:
Code : Tout sélectionner
chromatic_number(graph("petersen"))
in giacpy it gives:
Code : Tout sélectionner
>>> from giacpy import graph, chromatic_number
>>> chromatic_number(graph('"petersen"'))
Long-step dual simplex will be used
Number of 0-1 knapsack inequalities = 34
Constructing conflict graph...
Conflict graph has 20 + 9 = 29 vertices
3