#19007: Refactor Closeness Centrality
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Closeness | Merged in:
centrality | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | 7dfa2d26bcaf422f60b3ffd083bc535048922b2f
u/borassi/refactor_centrality_closeness| Stopgaps:
Dependencies: #18931, #18876, |
#18910 |
-------------------------------------+-------------------------------------
Comment (by borassi):
Hello!
I hope you spent a great Assumption day!
With this new commit, (hopefully) I solved the problems with `v_vert` and
I cythonized the Johnson algorithm. In my opinion, it is not worth
cythonizing Floyd-Warshall, because it is much slower than Johnson,
especially on sparse graphs.
Thank you very much!
Michele
--
Ticket URL: <http://trac.sagemath.org/ticket/19007#comment:12>
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.
