#19007: Refactor Closeness Centrality
----------------------------------------+------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Closeness centrality | Merged in:
Authors: Michele Borassi | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
----------------------------------------+------------------------
Changes (by {'newvalue': u'Michele Borassi', 'oldvalue': ''}):
* author: => Michele Borassi
* cc: ncohen, dcoudert (added)
* component: PLEASE CHANGE => graph theory
* keywords: => Closeness centrality
* type: PLEASE CHANGE => enhancement
Old description:
New description:
Now, the closeness centrality algorithm simply calls the corresponding
NetworkX routine (only for undirected graphs).
This ticket will move this routine to file generic_graph (closeness
centrality is defined also in this case ![1]), and it will modify
input/output variables as in routine shortest_path. Then, it will call our
shortest path new routines instead of NetworkX routines.
This ticket is a first step towards the inclusion of the algorithm in
![2].
![1] !http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6816651&tag=1
![2] !http://arxiv.org/pdf/1507.01490v1.pdf
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19007#comment:1>
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.
