#19337: Improve asteroidal triples code
-------------------------------------+-------------------------------------
Reporter: dcoudert | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: David Coudert | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dcoudert/asteroid | e32015d13649c7df56362fc9fd2b57937f465705
Dependencies: #19334 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dcoudert):
Hello,
the algorithm has time complexity `O(n^3)` and space complexity `O(n^2)`.
So we will certainly not use it on graphs with 100,000 nodes (I can't on
my laptop).
I was using `uint32_t` since `static_sparse_graph` uses it, but I agree
that `long` is more appropriate with `bitset_first_in_complement()`. So I
can use `long` for all indexes, or a more appropriate type if any.
For the arrays, all values stored in that array are in range `1..n`. So
either I use a 16 bits type and add a test at the beginning of the method
in case `n` needs more than that, or I use any type with at least 32 bits.
Well, `uint32_t` is good for that.
Let me know.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/19337#comment:19>
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.
