[sage-devel] Re: Finite automata over graphs: edges question

2008-12-22 Thread Pavel Sutyrin
Robert! > I completely agree! Much of this functionality was written as a > wrapper for NetworkX a while ago, and hasn't been revisited since. I > would happily review any patch that did this, and I've made it trac > ticket #4854. Thanks for blazing reply. I'm not sure yet how to do this consist

[sage-devel] Re: Finite automata over graphs: edges question

2008-12-22 Thread Pavel Sutyrin
> Welcome to the community!  We look forward to your contributions. > > I'm not sure exactly what thoughts or advice you are looking for.  Are > you proposing a change to Sage?  Are you asking about other efforts to > do similar things in python or Sage? Jason, thanks for fast reply. Our immedia

[sage-devel] Re: Finite automata over graphs: edges question

2008-12-22 Thread Pavel Sutyrin
Robert, > Most of the graph theory functions have a bunch of options for the > format of the output, I'd say this would follow that trend, taking the > old behavior as default. Ok. I will try to extract edge based paths from generic graph functions, depending on a new option. > > For now only a

[sage-devel] Re: Finite automata over graphs: edges question

2008-12-23 Thread Pavel Sutyrin
Privet Sébastien, Thanks for reply, > We are thinking of many new functionalities to add in the Words > library. Some of them are related to automata and languages. For > example, I was thinking to add a class for Language. For example, one > could create a finite language from Words like : > >

[sage-devel] Re: Finite automata over graphs: edges question

2008-12-23 Thread Pavel Sutyrin
Carl, Thanks for reply, > Actually, it's quite easy to intersect two context-free languages A > and B: the answer is "the intersection of A and B", and I think it > would be great if Sage would allow you to form such an intersection > (if you're going to have lots of different kinds of languages

[sage-devel] Re: Finite automata over graphs: edges question

2008-12-23 Thread Pavel Sutyrin
Carl, Thanks for reply, > Actually, it's quite easy to intersect two context-free languages A > and B: the answer is "the intersection of A and B", and I think it > would be great if Sage would allow you to form such an intersection > (if you're going to have lots of different kinds of languages

[sage-devel] Re: Notebook translation tips

2009-07-25 Thread Pavel Sutyrin
Sergei, > I tried to translate the interface of the notebook using gettext [...] That's great idea, somebody should already have started this :) > 3) Function convert_seconds_to_meaningful_time_span() must be > simplified [...] For example, in Russian we must have different ends for 1, 2-4, 5-.

[sage-devel] MPFR real field constructor strangely fails

2009-11-09 Thread Pavel Sutyrin
Hi all, After updating from 3.2 to 4.2 (both by sage -upgrade and rebuilding from fresh tarball) I get following result, when trying to merely import graphs.graph module: == pa...@pavelx:~$ uname -a Linux pavelx 2.6.30-2-amd64 #1 SMP Fri Sep

[sage-devel] Re: MPFR real field constructor strangely fails

2009-11-09 Thread Pavel Sutyrin
> After updating from 3.2 to  4.2  (both by sage -upgrade and rebuilding > from fresh tarball) I get following result, when trying to merely > import graphs.graph module: And yes, all unit tests for graphs do pass. :-/ --Pavel. --~--~-~--~~~---~--~~ To post to thi

[sage-devel] Re: MPFR real field constructor strangely fails

2009-11-09 Thread Pavel Sutyrin
> Also, try putting >   import sage.all > right at the top of 1.py. Thanks, William, this just worked. 1.py is a script that uses graphs. --Pavel. --~--~-~--~~~---~--~~ To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this g