From b2fbb011e6c98849037618456ee93a5efe9b22da Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Micha=C5=82=20Zieli=C5=84ski?= <michal@zielinscy.org.pl>
Date: Mon, 27 Jul 2015 21:16:01 +0200
Subject: [PATCH] autopep8 graphPlotter

---
 web/graphPlotter.py | 94 ++++++++++++++++++++++-----------------------
 1 file changed, 45 insertions(+), 49 deletions(-)

diff --git a/web/graphPlotter.py b/web/graphPlotter.py
index 017b153..197732b 100644
--- a/web/graphPlotter.py
+++ b/web/graphPlotter.py
@@ -4,71 +4,67 @@ import json
 
 
 def position_nodes(nodes, edges):
-	G = pgv.AGraph(strict=True, directed=False, size='10!')
+    G = pgv.AGraph(strict=True, directed=False, size='10!')
 
-	for n in nodes.values():
-		G.add_node(n.ip, label=n.label, version=n.version)
+    for n in nodes.values():
+        G.add_node(n.ip, label=n.label, version=n.version)
 
-	for e in edges:
-		G.add_edge(e.a.ip, e.b.ip, len=1.0)
+    for e in edges:
+        G.add_edge(e.a.ip, e.b.ip, len=1.0)
 
-	G.layout(prog='neato', args='-Gepsilon=0.0001 -Gmaxiter=100000')
-
-	return G
+    G.layout(prog='neato', args='-Gepsilon=0.0001 -Gmaxiter=100000')
 
+    return G
 
 
 def get_graph_json(G):
-	max_neighbors = 1
-	for n in G.iternodes():
-		neighbors = len(G.neighbors(n))
-		if neighbors > max_neighbors:
-			max_neighbors = neighbors
-	print 'Max neighbors: %d' % max_neighbors
+    max_neighbors = 1
+    for n in G.iternodes():
+        neighbors = len(G.neighbors(n))
+        if neighbors > max_neighbors:
+            max_neighbors = neighbors
+    print 'Max neighbors: %d' % max_neighbors
 
-	out_data = {
-		'created': int(time.time()),
-		'nodes': [],
-		'edges': []
-	}
+    out_data = {
+        'created': int(time.time()),
+        'nodes': [],
+        'edges': []
+    }
 
-	for n in G.iternodes():
-		neighbor_ratio = len(G.neighbors(n)) / float(max_neighbors)
-		pos = n.attr['pos'].split(',', 1)
-
-		out_data['nodes'].append({
-			'id': n.name,
-			'label': n.attr['label'],
-			'version': n.attr['version'],
-			'x': float(pos[0]),
-			'y': float(pos[1]),
-			'color': _gradient_color(neighbor_ratio, [(100, 100, 100), (0, 0, 0)]),
-			'size': neighbor_ratio
-		})
-
-	for e in G.iteredges():
-		out_data['edges'].append({
-			'sourceID': e[0],
-			'targetID': e[1]
-		})
-
-	return json.dumps(out_data)
+    for n in G.iternodes():
+        neighbor_ratio = len(G.neighbors(n)) / float(max_neighbors)
+        pos = n.attr['pos'].split(',', 1)
 
+        out_data['nodes'].append({
+            'id': n.name,
+            'label': n.attr['label'],
+            'version': n.attr['version'],
+            'x': float(pos[0]),
+            'y': float(pos[1]),
+            'color': _gradient_color(neighbor_ratio, [(100, 100, 100), (0, 0, 0)]),
+            'size': neighbor_ratio
+        })
 
+    for e in G.iteredges():
+        out_data['edges'].append({
+            'sourceID': e[0],
+            'targetID': e[1]
+        })
 
+    return json.dumps(out_data)
 
 
 def _gradient_color(ratio, colors):
-	jump = 1.0 / (len(colors) - 1)
-	gap_num = int(ratio / (jump + 0.0000001))
+    jump = 1.0 / (len(colors) - 1)
+    gap_num = int(ratio / (jump + 0.0000001))
 
-	a = colors[gap_num]
-	b = colors[gap_num + 1]
+    a = colors[gap_num]
+    b = colors[gap_num + 1]
 
-	ratio = (ratio - gap_num * jump) * (len(colors) - 1)
+    ratio = (ratio - gap_num * jump) * (len(colors) - 1)
 
-	r = a[0] + (b[0] - a[0]) * ratio
-	g = a[1] + (b[1] - a[1]) * ratio
-	b = a[2] + (b[2] - a[2]) * ratio
+    r = a[0] + (b[0] - a[0]) * ratio
+    g = a[1] + (b[1] - a[1]) * ratio
+    b = a[2] + (b[2] - a[2]) * ratio
 
-	return '#%02x%02x%02x' % (r, g, b)
\ No newline at end of file
+    return '#%02x%02x%02x' % (r, g, b)