#18317: General documentation about graph data structures
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.7
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | b7d90367738afb7bfcf2d97701451fccbeebf31f
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18317 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by darij):
Replying to [comment:6 ncohen]:
> Yesyes. Did you find one that I missed in my last commit?
No, sorry, I meant the "you" as a generic. The actual you has fixed this
in your last commit.
> Hmmm.. Well, I'm used to document a feature or a corner-case, but it's
my first time trying to document something which is not there. And if
there was some place to do that, it is very unlikely that it would also be
found by whoever is interested. In `GenericGraph.edges` perhaps?
Sorry, I mean document, not doctest. Just say that edges in a multigraph
are stored as elements of multisets, so if there are two edges from `a` to
`b` in an unlabelled (di)multigraph, then they will be implemented not as
two separate objects but as one object appearing twice in a multiset of
edges. Say that this is not the convention used in quiver theory, and that
the latter can be simulated using labelled (di)graphs.
--
Ticket URL: <http://trac.sagemath.org/ticket/18317#comment:7>
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/d/optout.
