#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: | 84031c3875f0ad14db2d984c43373af32bdc704f
u/borassi/new_algorithm_for_top_k_closeness_centralities| Stopgaps:
Dependencies: #19007,#19014 |
-------------------------------------+-------------------------------------
Comment (by dcoudert):
> > About the behavior when `k>=n`. What you propose is in fact to return
the centrality closeness (as a list of couples (centrality,vertex) ).
> > - Is your method faster than `centrality_closeness` in this case?
>
> No, it should be the same (actually, a bit slower because we make some
computations during the BFSes).
So you should add a test `if k>=n` at the beginning of the method and if
True call the other method and format the result. You could also add a
test `n==0` and/or `n==1` where the result is obvious.
--
Ticket URL: <http://trac.sagemath.org/ticket/19031#comment:13>
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.
