memory efficient implementation of Wiener index

sagemath / sage

Main repository of SageMath

https://www.sagemath.org

Other

1.3k stars 447 forks source link

memory efficient implementation of Wiener index #30247

Closed dcoudert closed 4 years ago

dcoudert commented 4 years ago

We improve the implementation of Wiener index for (weighted) (di)graphs by avoiding to compute and store into memory the full distance matrix. This way we can compute this index for larger graphs.

CC: @vipul79321 @kliem

Component: graph theory

Keywords: gsoc2020

Author: David Coudert, Vipul Gupta

Branch/Commit: acf7647

Reviewer: Vipul Gupta, Jonathan Kliem

Issue created by migration from https://trac.sagemath.org/ticket/30247

dcoudert commented 4 years ago

comment:38

Thank you. Do not hesitate to add your name as reviewer.

kliem commented 4 years ago

Changed reviewer from Vipul Gupta to Vipul Gupta, Jonathan Kliem

vbraun commented 4 years ago

Changed branch from public/graphs/30247_wiener to acf7647