#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: | 5c67f79dcb519e1df3a76021677a8292583a3d31
u/borassi/refactor_centrality_closeness| Stopgaps:
Dependencies: #18931, #18876, |
#18910 |
-------------------------------------+-------------------------------------
Comment (by borassi):
Hello!
I tried to improve the documentation, answering your questions.
Michele
Replying to [comment:13 dcoudert]:
> You wrote that the centrality of vertices of degree 0 is not reported.
Does it means that for digraphs you don't report the centrality of
vertices with out-degree 0?
Yes, I changed in the documentation "degree" with "(out)degree"
> Also, what's the expected behavior on strongly connected digraphs?
The closeness centrality of a vertex v is 1/farn(v), where farn(v) is the
average distance between v and a random vertex w different from v (as in
the case of connected graphs). I added an example about this.
--
Ticket URL: <http://trac.sagemath.org/ticket/19007#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.
