From 00e5bf3c2d83003d0fe967b7975591000eb1d9a8 Mon Sep 17 00:00:00 2001
From: zimmermann <zimmermann@cl.uni-heidelberg.de>
Date: Thu, 22 Mar 2018 19:13:43 +0100
Subject: [PATCH] Fixed Zero Division Error. Mankinds greatest challenge
 resolved with try-except!

---
 src/absinth.py   | 10 +++++++---
 src/abstinent.py | 10 +++++++---
 2 files changed, 14 insertions(+), 6 deletions(-)

diff --git a/src/absinth.py b/src/absinth.py
index 1c527ff..e777ccf 100644
--- a/src/absinth.py
+++ b/src/absinth.py
@@ -151,7 +151,7 @@ def induce(topic_name: str, result_list: list) -> (nx.Graph, list, dict):
                 edge_freq_dict = {(key1,key2):value2 for key1,value1 in edge_freq_dict.items() for key2,value2 in value1.items()}
 
                 print('[a] Collected frequencies from secret hideout.')
-                
+
             continue
     
     if graph_in_existence == False:
@@ -1022,8 +1022,12 @@ def main(topic_id: int, topic_name: str, result_dict: dict) -> None:
         
         edge_count = len(graph.edges)
         node_count = len(graph.nodes)
-        mean_degree = edge_count/node_count
-        
+
+        try:
+            mean_degree = edge_count/node_count
+        except ZeroDivisionError:
+            mean_degree = 0
+
         stat_dict['L_rand'] = np.log(node_count)/np.log(mean_degree)
         stat_dict['C_rand'] = 2 * mean_degree/node_count
         
diff --git a/src/abstinent.py b/src/abstinent.py
index e4aa170..5536301 100644
--- a/src/abstinent.py
+++ b/src/abstinent.py
@@ -368,7 +368,7 @@ def induce(topic_name: str, result_list: list) -> (nx.Graph, list, dict):
 
                 edge_freq_dict = {(key1,key2):value2 for key1,value1 in edge_freq_dict.items() for key2,value2 in value1.items()}
 
-                print('[a] Collected frequencies from hidden hideout.')
+                print('[a] Collected frequencies from secret hideout.')
 
             continue
     
@@ -634,8 +634,12 @@ def main(topic_id: int, topic_name: str, result_dict: dict) -> None:
         
         edge_count = len(graph.edges)
         node_count = len(graph.nodes)
-        mean_degree = edge_count/node_count
-        
+
+        try:
+            mean_degree = edge_count/node_count
+        except ZeroDivisionError:
+            mean_degree = 0
+
         stat_dict['L_rand'] = np.log(node_count)/np.log(mean_degree)
         stat_dict['C_rand'] = 2 * mean_degree/node_count
         
-- 
GitLab