[med-svn] [Git][med-team/python-leidenalg][upstream] New upstream version 0.8.7

Nilesh Patra (@nilesh) gitlab at salsa.debian.org
Fri Jul 9 17:38:17 BST 2021



Nilesh Patra pushed to branch upstream at Debian Med / python-leidenalg


Commits:
99833386 by Nilesh Patra at 2021-07-09T22:02:28+05:30
New upstream version 0.8.7
- - - - -


4 changed files:

- .github/workflows/build.yml
- CHANGELOG
- include/Optimiser.h
- src/leidenalg/Optimiser.cpp


Changes:

=====================================
.github/workflows/build.yml
=====================================
@@ -4,11 +4,12 @@ on:
   push:
     branches:
       - master
+    tags:
+      - '*'
   pull_request:
     branches:
       - master
 
-
 env:
   CIBW_TEST_REQUIRES: ddt
   CIBW_TEST_COMMAND: "cd {project} && python -m unittest -v"


=====================================
CHANGELOG
=====================================
@@ -1,3 +1,6 @@
+0.8.7
+- Improved numerical stability
+
 0.8.6
 - Removed accidentally left DEBUG statement
 


=====================================
include/Optimiser.h
=====================================
@@ -4,6 +4,7 @@
 #include "MutableVertexPartition.h"
 #include <set>
 #include <map>
+#include <cfloat>
 
 #include <iostream>
 using std::cerr;


=====================================
src/leidenalg/Optimiser.cpp
=====================================
@@ -645,7 +645,7 @@ double Optimiser::move_nodes(vector<MutableVertexPartition*> partitions, vector<
     #endif
 
     size_t max_comm = v_comm;
-    double max_improv = (0 < max_comm_size && max_comm_size < partitions[0]->csize(v_comm)) ? -INFINITY : 0;
+    double max_improv = (0 < max_comm_size && max_comm_size < partitions[0]->csize(v_comm)) ? -INFINITY : 10*DBL_EPSILON;
     size_t v_size = graphs[0]->node_size(v);
     for (size_t comm : comms)
     {
@@ -1118,7 +1118,7 @@ double Optimiser::move_nodes_constrained(vector<MutableVertexPartition*> partiti
     #endif
 
     size_t max_comm = v_comm;
-    double max_improv = (0 < max_comm_size && max_comm_size < partitions[0]->csize(v_comm)) ? -INFINITY : 0;
+    double max_improv = (0 < max_comm_size && max_comm_size < partitions[0]->csize(v_comm)) ? -INFINITY : 10*DBL_EPSILON;
     size_t v_size = graphs[0]->node_size(v);
     for (size_t comm : comms)
     {



View it on GitLab: https://salsa.debian.org/med-team/python-leidenalg/-/commit/9983338686a6d41592dbbbde92101a89e3c3fb98

-- 
View it on GitLab: https://salsa.debian.org/med-team/python-leidenalg/-/commit/9983338686a6d41592dbbbde92101a89e3c3fb98
You're receiving this email because of your account on salsa.debian.org.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://alioth-lists.debian.net/pipermail/debian-med-commit/attachments/20210709/d0f03b65/attachment-0001.htm>


More information about the debian-med-commit mailing list