#16395: adjacency_matrix raises error for large multigraphs
-------------------------------------+-------------------------------------
Reporter: lipshitz | Owner:
Type: defect | Status: needs_review
Priority: minor | Milestone: sage-6.3
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/lipshitz/ticket/16395 | c1e702c8e65ca6b2b3c3f8f6cbd093ff40ea4145
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by lipshitz):
* status: needs_info => needs_review
Comment:
Replying to [comment:9 ncohen]:
> Hello !
>
> > Fair enough! On the other hand, the relevant notion here seems to be
the density of the honest graph obtained by replacing each multiple edge
with a single edge.
>
> I agree, but this is too expensive. And this is equivalent to building a
sparse matrix, computing the number of non-null entries, and converting it
to a dense matrix if it saves space.
>
> > I could change the code to compute that, and decide whether to return
a dense or sparse matrix based on that computation. Or just have multi
graphs always return a dense matrix, like the code does now. Do you have a
preference?
>
> Returning a dense matrix in all cases makes sense to me.
>
> Nathann
Done, I think.
Robert
--
Ticket URL: <http://trac.sagemath.org/ticket/16395#comment:11>
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.
