#15495: Flip graph of pure simplicial complex
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.1
Component: combinatorics | Resolution:
Keywords: simplicial | Merged in:
complex | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: | 10ab84bb32b14ce82e2ba4a2a66a72edd972c1ab
u/stumpc5/ticket/15495 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Yop !
I don't know much about simplicial complices, yet I think it would be
terribly faster if you created this graph in two steps :
1) Create a dictionary associating to each d-1 face the list of all facets
that contain it
2) For each facet, create an edge between any two of the faces that
contain it
In order to build 1), it would be cool if there was a quick way to list
the d-1 faces contained in a d-face. If there isn't just creating the
dictionary :
`{dm1_face : [f for f in self.faces() if dm1_face.is_face(f)] for dm1_face
in self.n_faces(d-1)}`
Already makes you earn an order of magnitude.
Besides, if `.faces()` can contain a lot of faces of order `<d-1`, it
would probably be better to filter them out first, as you test face
containment VERY often.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15495#comment:3>
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.
