Changes between Initial Version and Version 18 of Ticket #18864


Ignore:
Timestamp:
07/10/15 15:54:42 (4 years ago)
Author:
dcoudert
Comment:

I have implemented requested changes. However, I propose to restrict this patch to undirected graph and to consider directed graphs in another ticket. Best, David.

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #18864

    • Property Status changed from new to needs_review
    • Property Cc ncohen borassi added
    • Property Summary changed from New method for the eccentricity to New method for the eccentricity of undirected graphs
    • Property Branch changed from to public/18864
    • Property Commit changed from to a3717b73c811ff702345a186b679df4b99e725fa
    • Property Type changed from PLEASE CHANGE to enhancement
  • Ticket #18864 – Description

    initial v18  
    1 This patch implements the algorithm proposed in [1] for computing the eccentricity of all vertices. It can be faster than the standard algorithm.
     1This patch implements the algorithm proposed in [1] for computing the eccentricity of all vertices of a connected undirected unweighted graph. It can be faster than the standard algorithm.
    22
    33{{{
     
    1919}}}
    2020
     21Similar method for directed graphs and weighted (di)graphs can be the object of future tickets.
    2122
     23----
    2224[1] F. W. Takes and W. A. Kosters. Computing the eccentricity distribution of large graphs. *Algorithms* 6:100-118 (2013) http://dx.doi.org/10.3390/a6010100