The "Search and Shortest Path" section could also include other
functions about paths and cycles :
sage: g = digraphs.Circuit(4)
sage: g.all_
g.all_cycles_iteratorg.all_simple_cycles
g.all_paths g.all_simple_paths
g.all_paths_iterator
The only problem is that these functions are
Hi !
Thank you for the detailed answer. It will help to find someone who
could work on the Windows port and I'm glad it seems reasonable to ask
a good undergraduated student in computer science to do the job, at
least partially.
Alexandre
--
To post to this group, send an email to sage-devel@go
Hi, all!
I know this is a recurrent subject, but I was wondering what was the
status about the Windows port. As many other users/developers of Sage,
I promote it the most I can but one obstacle that keeps showing up is
that it does not work natively on Windows. I know that there is the
VMWare solu
Hi, Nicolas!
On 23 fév, 02:44, "Nicolas M. Thiery"
wrote:
> Hi Alexandre!
>
>
> I assume Eviatar's message was really about using Sage's symbolic
> capabilities for manipulating systems of equations. Not Sage's
> symbolic solver. So one could imagine doing something like:
>
> sage: sy
You're right!
Thanks!
Alex
On 16 fév, 17:42, Mike Hansen wrote:
> On Wed, Feb 16, 2011 at 11:40 PM, Alexandre Blondin Massé
>
> wrote:
> > Maybe it's worth including such a package in Sage if it's not already
> > done?
>
> I believe it's
>
> > In that case I would think specialized functions would be better, such
> > as palindromes(u). For parsing, could you not use regular expressions?
>
> I guess regular expressions would be ok, but more work is needed.
> Ideally, I would like to delegate that work to a module that does all
> the
On 16 fév, 15:52, Eviatar wrote:
> Another option would be to use Sage's existing symbolic capabilities.
> For example:
>
> sage: solve(u*v==log(u*v), u)
> [u == log(u*v)/v]
The equations I'm handling are on words, not on numbers. More
precisely, the * operation is the concatenation (it has a mon
On 16 fév, 15:47, Eviatar wrote:
> Hello!
>
> I'm wondering why you would want to include it like this; it doesn't
> follow Python syntax. "=" is for assignment, and this: "u * v = phi(u
> * v)" would return a syntax error in Python. I suppose you mean "=="?
This would be a new syntax between sin
Hi, everyone!
I'm interested in including a Sage module that allows one to handle
systems of equations on words. For instance, if one wants to find all
solutions of the equation u = ~(u) (where ~ means the reversal of the
word, i.e. rewriting it in the opposite order), one should get the
palindrom
>
> In that case, since it's compiling a C++ file, the variable should be called
> CXX, so changing to
>
> $(CXX) $(CFLAGS) -c cubex.cpp
> and removing the line
> CC=g++
>
> makes it use Sage's variable.
>
It doesn't change much to the problem, but instead of removing the
line
CC = g++
I think you
> I use 'vi' myself.
Same for me.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagem
Are you studying the directed version of the minimum feedback vertex
or the undirected one or both ?
I'm currently working on the directed one and I'm not using linear
programming. I plan to write a patch soon about it.
Moreover, some teacher told me that this problem is hard to tackle
with linear
Still no taker for the review ? Maybe I'll end being the one who does it. By
the way, do the review include Linear Programming or has it already been
done ?
Alex
2009/8/27 Nathann Cohen
>
> Hello everybody !!!
>
> I sent some time ago a few patches in the Graph Theory section that
> would really
13 matches
Mail list logo
