From 0b2e8ce08fc58902896934c26072bacfd0ca8ba9 Mon Sep 17 00:00:00 2001
From: Benoit GAUZERE <benoit.gauzere@insa-rouen.fr>
Date: Thu, 23 Nov 2017 15:11:56 +0100
Subject: [PATCH] Correction of minor bug on shortest paths computations

---
 pygraph/utils/utils.py | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/pygraph/utils/utils.py b/pygraph/utils/utils.py
index d9145b9..1d12690 100644
--- a/pygraph/utils/utils.py
+++ b/pygraph/utils/utils.py
@@ -5,6 +5,7 @@ import numpy as np
 def getSPLengths(G1):
     sp = nx.shortest_path(G1)
     distances = np.zeros((G1.number_of_nodes(), G1.number_of_nodes()))
-    for i in np.keys():
-        for j in np[i].keys():
+    for i in sp.keys():
+        for j in sp[i].keys():
             distances[i, j] = len(sp[i][j])-1
+    return distances