diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2015-03-30 15:01:56 -0400 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2015-03-30 15:01:56 -0400 |
| commit | b84dddecf2eab982941704a43663cf643be027d3 (patch) | |
| tree | 273afacb4e2d2e043a6bbf75f774d8752e9fc202 /experiments/distances.py | |
| parent | 68187fcfb505e87e5853c5a1b2e1dc073278a2ba (diff) | |
| download | criminal_cascades-b84dddecf2eab982941704a43663cf643be027d3.tar.gz | |
Archive old code
Diffstat (limited to 'experiments/distances.py')
| -rw-r--r-- | experiments/distances.py | 42 |
1 files changed, 0 insertions, 42 deletions
diff --git a/experiments/distances.py b/experiments/distances.py deleted file mode 100644 index 1834d36..0000000 --- a/experiments/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() |
