Hello,
I'm working on directed graphs. So
sage : G = DiGraph()
...
and I want to know if my graph G is strongly connected. There is such
a method in networkx but it seems that this features disappear in SAGE
(?). Moreover, there is a method strongly_connected_components which
return the
the real function I wrote is more :
def is_strongly_connected(G) :
if len(G.vertices) == 0 : return True
return len(G.strongly_connected_components()) == 1
It is really not the same !
On 16 jan, 09:34, Vincent D 20100.delecr...@gmail.com wrote:
Hello,
I'm working on directed graphs.
On Jan 16, 2009, at 12:34 AM, Vincent D wrote:
Hello,
I'm working on directed graphs. So
sage : G = DiGraph()
...
and I want to know if my graph G is strongly connected. There is such
a method in networkx but it seems that this features disappear in SAGE
(?). Moreover, there is a
Probably it's a silly question, but I get this output when trying to apply
the patch. Do I need to create a mercurial repository or fetch something
else first?
Fabio
**
sage: hg_sage.import_patch(./fill_plot.patch)
WARNING:
Make sure to create a ~/.hgrc
Hello,
On Fri, Jan 16, 2009 at 2:26 AM, Fabio Tonti fto...@gmail.com wrote:
Probably it's a silly question, but I get this output when trying to apply
the patch. Do I need to create a mercurial repository or fetch something
else first?
...
cd
Wow, thanks. I should have thought about that.
The fill-feature really works great! Thank you.
Cheers, Fabio
On Fri, Jan 16, 2009 at 11:40 AM, Mike Hansen mhan...@gmail.com wrote:
Hello,
On Fri, Jan 16, 2009 at 2:26 AM, Fabio Tonti fto...@gmail.com wrote:
Probably it's a silly question,
Hello, i've updated my published worksheet from above.
To clearify this, the polyfit is actually numpy's and the glm
(generalized linear model) is from R. Sage just enables you to use
both of them (more or less seamless). I don't know any chemical
problems, i've just some background in
We do have ticket #1483, http://trac.sagemath.org/sage_trac/ticket/1483,
which could be warped into adding support for ffmpeg. I am also
interested in learning how to use javascript to do it but my
javascript skills are still too low. One of my goals for this year is
to become much better at
Dear Support,
Brief question - if I Publish something, and then change the worksheet
and publish again, does it update the Published worksheet or create a
new Published worksheet? I hope the former is true...
Thanks,
- kcrisman
--~--~-~--~~~---~--~~
To post to
On Fri, Jan 16, 2009 at 7:36 AM, kcrisman kcris...@gmail.com wrote:
Dear Support,
Brief question - if I Publish something, and then change the worksheet
and publish again, does it update the Published worksheet or create a
new Published worksheet? I hope the former is true...
Update.
If
You could easily tell the answer to your question by simply trying,
right? So I'm guessing you did, and the result wasn't what you
expected, otherwise you wouldn't have asked the question. Thus maybe
there is a bug? Can you clarify?
I am ashamed to admit that I didn't want to clutter up
On Jan 15, 10:52 pm, Justin C. Walker jus...@mac.com wrote:
If the temp files are truly temp files (i.e., not of interest when the
process that creates them exits), then there are Python calls that
help: the temp files can be created and unlinked, so that at exit,
they vanish. In fact,
On Jan 16, 2009, at 9:36 AM, Carl Witty wrote:
On Jan 15, 10:52 pm, Justin C. Walker jus...@mac.com wrote:
If the temp files are truly temp files (i.e., not of interest when
the
process that creates them exits), then there are Python calls that
help: the temp files can be created and
Hello,
After reading the doc string of is_isomorphic I thought that for two
edge-labelled graphs g,h, g.is_isomorphic(h, edge_labels=True) would be
true exactly when there is a label preserving isomorphism between the two
graphs. However:
sage: foo.edges()
[(0, 1, 2), (0, 2, 1), (2, 3, 3)]
sage: foo.edges()
[(0, 1, 2), (0, 2, 1), (2, 3, 3)]
sage: bar.edges()
[(0, 1, 1), (0, 2, 2), (2, 3, 3)]
sage: bar.is_isomorphic(foo, edge_labels = True)
True
I think there is a label-preserving isomorphism here, isn't there?
0-0 1-2 2-1 3-3
Nathan
Nathan Carter nathancart...@gmail.com writes:
sage: foo.edges()
[(0, 1, 2), (0, 2, 1), (2, 3, 3)]
sage: bar.edges()
[(0, 1, 1), (0, 2, 2), (2, 3, 3)]
sage: bar.is_isomorphic(foo, edge_labels = True)
True
I think there is a label-preserving isomorphism here, isn't there?
0-0 1-2
BTW, shouldn't the generator of the automorphism group be presented
as (0,2)(1,3)?
Good luck ever convincing the right systems that this should happen:
GAP's permutation groups don't allow you to permute on the letter 0.
See the translation option of automorphism_group on that... This has
been
I've been attempting to answer my own questions here by Googling
around, and I must admit that this is a highly frustrating
experience. I have rather extensive computer experience and I'm
finding a SAGE server maddening to set up. Do normal mathematicians
find this easy and I'm just being
Well, I guess I'll answer my own question, especially since I'm
feeling rather like a moron. I Googled like crazy when what I should
just have done was read the manual. D'oh.
http://www.sagemath.org/doc/inst/node8.html
http://www.sagemath.org/doc/inst/node10.html
Nathan
On Jan 16, 9:18 pm,
Nathan,
I'm sorry to hear of your frustration. We've tried to make it easy,
in fact everyone who uses Sage via the notebook interface starts up a
Sage server. The issue here is that giving someone a Sage notebook
account is basically giving them shell access--something you wouldn't
want
Robert Bradshaw wrote:
Nathan,
I'm sorry to hear of your frustration. We've tried to make it easy,
in fact everyone who uses Sage via the notebook interface starts up a
Sage server. The issue here is that giving someone a Sage notebook
account is basically giving them shell
I can also post up my virtualbox image, for those interested.
If you did, then the only thing left to do for the rest of us is the
port-forwarding calls and a call to start up VirtualBox? That seems
like an astonishingly easy solution--even better than the, um, [insert
embarrassed
Nathan Carter wrote:
Well, I guess I'll answer my own question, especially since I'm
feeling rather like a moron. I Googled like crazy when what I should
just have done was read the manual. D'oh.
http://www.sagemath.org/doc/inst/node8.html
http://www.sagemath.org/doc/inst/node10.html
Vincent, it seems that you are looking at the wrong section of the
code. The line you referenced is specific to drawing directed graphs,
and unfortunately in the current version (3.2.3) we are still using a
direct call to NetworkX for the basic graph drawing. This call needs
to be overwritten,
This is a known bug:
http://trac.sagemath.org/sage_trac/ticket/2120
I hope it gets looked at again at Sage Days next week (which is a week
of developers fixing bugs).
I will be really glad if this happens!
Andrey
--~--~-~--~~~---~--~~
To post to this
On Fri, Jan 16, 2009 at 6:54 PM, Jason Grout
jason-s...@creativetrax.com wrote:
Nathan Carter wrote:
Well, I guess I'll answer my own question, especially since I'm
feeling rather like a moron. I Googled like crazy when what I should
just have done was read the manual. D'oh.
leeclarks...@gmail.com wrote:
Vincent, it seems that you are looking at the wrong section of the
code. The line you referenced is specific to drawing directed graphs,
and unfortunately in the current version (3.2.3) we are still using a
direct call to NetworkX for the basic graph drawing.
1. How can I compute the cokernel of a matrix? For example:
sage: mat = matrix(ZZ, 2, 2, [[1, 0], [0, 2]])
sage: M = FreeModule(ZZ, rank=2)
Then I would like to use M / mat.image() or M / mat.column_module(),
but those give errors. (It works if M and mat are defined over QQ, and
perhaps over
On Fri, Jan 16, 2009 at 9:22 PM, John H Palmieri jhpalmier...@gmail.com wrote:
1. How can I compute the cokernel of a matrix? For example:
sage: mat = matrix(ZZ, 2, 2, [[1, 0], [0, 2]])
sage: M = FreeModule(ZZ, rank=2)
Then I would like to use M / mat.image() or M / mat.column_module(),
29 matches
Mail list logo
