summaryrefslogtreecommitdiffstats
path: root/experiments/old_stuff/distances.py
diff options
context:
space:
mode:
Diffstat (limited to 'experiments/old_stuff/distances.py')
-rw-r--r--experiments/old_stuff/distances.py42
1 files changed, 0 insertions, 42 deletions
diff --git a/experiments/old_stuff/distances.py b/experiments/old_stuff/distances.py
deleted file mode 100644
index 1834d36..0000000
--- a/experiments/old_stuff/distances.py
+++ /dev/null
@@ -1,42 +0,0 @@
-import networkx as nx
-import sys
-from collections import Counter
-
-
-def build_graph(filename):
- g = nx.Graph()
- with open(filename) as fh:
- fh.readline()
- for line in fh:
- i, j = map(lambda x: int(float(x)), line.strip().split(",")[1:])
- g.add_edge(i, j)
- return g
-
-
-def distances(g):
- victims = set()
- with open("vics.csv") as fh:
- fh.readline()
- for line in fh:
- victims.add(int(line.strip().split(",")[1]))
- level = 0
- seen = {}
- nextlevel = {v: 1 for v in victims}
- while level <= 3:
- thislevel = nextlevel
- nextlevel = {}
- for v in thislevel:
- if v not in seen:
- seen[v] = level
- nextlevel.update(g[v])
- level += 1
- return seen
-
-
-if __name__ == "__main__":
- g = build_graph(sys.argv[1])
- print g.number_of_nodes(), g.number_of_edges()
- cnt = Counter()
- for v, d in distances(g).iteritems():
- cnt[d] += 1
- print cnt.most_common()