#19031: New Algorithm for Top-K Closeness Centralities
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Closeness | Merged in:
Centrality, top-k | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | ced875f0b1fba123a0921d5937f894cc8fe41b1e
u/borassi/new_algorithm_for_top_k_closeness_centralities| Stopgaps:
Dependencies: #19007,#19014 |
-------------------------------------+-------------------------------------
Comment (by borassi):
Helloooooooo!
After we moved `centrality_closeness` back to `generic_graph`, I had to
rebase this ticket. The new algorithm is still in file `centrality.pyx`,
but it is not available in `generic_graph` (that is,
`g.centrality_closeness_top_k()` does not work anymore). However, I don't
think this is a serious issue, because this algorithm in used in very
specialized cases, and the standard Sage user does not need it, in my
opinion.
Cheers,
Michele
--
Ticket URL: <http://trac.sagemath.org/ticket/19031#comment:16>
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.
