Hi!
In order to create a right module over a path algebra P, with a vector space
basis given by the potentially infinite family of paths starting at some
vertex, I thought I'd start with CombinatorialFreeModule.
My expectation was that it would work *easily* and out of the box, if
- one provides
Hi Travis,
On 2015-06-19, Travis Scrimshaw tsc...@ucdavis.edu wrote:
Hey Simon,
That is correct and the only way I know of AFAIK.
Thank you!
Cheers,
Simon
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this
On Fri, Jun 19, 2015 at 09:31:21PM +, Simon King wrote:
Hi!
Let D be a digraph, potentially with multiple edges and loops. Let v be
a vertex.
How should one test whether v is contained in a cycle (including loops)?
Is it correct that v is in a cycle or loop if and only if
Hi Nicolas,
On 2015-06-20, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote:
- search for a path from one of the out neighbors of v to v
Sure, but how? In fact I was looking for a method of digraphs telling me
whether there is a path from vertex v to vertex w, but I couldn't find
one.
w in
PS:
I think it would be nice if CombinatorialFreeModule.Element would
actually use Sage's coercion framework.
Is there a ticket to make CombinatorialFreeModule.Element a Cython class
using the infrastructure that is provided by
sage.structure.element.ModuleElement?
Best regards,
Simon
--
You
