On 12-Jun-09, at 10:23 AM, Alexandre Blondin Mass� wrote:
>
> By the way, do you know if somebody is working on functions related to
> cycles ? I didn't find anything on the web except Ticket #698
> http://trac.sagemath.org/sage_trac/ticket/698
> in which the author lists many functions not impl
By the way, do you know if somebody is working on functions related to
cycles ? I didn't find anything on the web except Ticket #698
http://trac.sagemath.org/sage_trac/ticket/698
in which the author lists many functions not implemented yet in sage.
Alexandre
On 12 juin, 12:11, Alexandre Blondin M
Hi, Rob,
Thanks for you quick reply! I think that many of the functions I have
would be easily generalized to undirected graphs. I will think about a
precise list of functions I intend to share/improve/code along with
what they do. I should come back soon about that.
Alex
On 10 juin, 23:32, Rob B
Alexandre,
Today I wanted a 6-cycle from a large graph, so such a function would
have been welcome. If it is convenient you might have your routine
return a generator. Then it can be used to test existence of such a
cycle, employed to get once to get a single cycle, or used to iterate
over some
On Tue, 24 Oct 2006 13:20:03 -0500, Joshua Kantor <[EMAIL PROTECTED]>
wrote:
> This idea is probably totally naive as my understanding of the
> exact mechanics of shared object libraries is still somewhat black
> boxish.
>
> Say I have a routine that takes a pointer to some C function. I define
This idea is probably totally naive as my understanding of the
exact mechanics of shared object libraries is still somewhat black
boxish.
Say I have a routine that takes a pointer to some C function. I define
a
shared object library of C function wrappers. Say it just has a C
function foo. Then s
