#12630: Add representations of quivers and quiver algebras to sage
-------------------------------------+-------------------------------------
Reporter: JStarx | Owner: AlexGhitza
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.2
Component: algebra | Resolution:
Keywords: algebra, quiver, | Merged in:
module, days49 | Reviewers: Simon King
Authors: Jim Stark, Simon | Work issues:
King, Mathieu Guay-Paquet, Aladin | Commit:
Virmaux | 72fb2eb71459f4ac76b0d922a7ad788c660a8017
Report Upstream: N/A | Stopgaps:
Branch: |
u/SimonKing/ticket/12630 |
Dependencies: #12412, #12413, |
#14806, #15491, #15623 |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hellooooo !
> ... or perhaps add a new method `neighbor_out_arrows_iterator`, that is
to be used by `all_paths` depending on an optional parameter.
``list(digraphs.Circuit(5).edge_iterator(1))`` ?
> PS: I don't think an `all_paths` method makes any sense (to people using
cyclic graphs, at least). In general, you'd have an infinite list, hence,
an iterator is the best you can hope for.
Paths. Not Walks. Paths do not self-intersect.
This being said, an iterator *IS* enough.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/12630#comment:174>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
