diff options
author | KatolaZ <katolaz@yahoo.it> | 2015-10-19 16:23:00 +0100 |
---|---|---|
committer | KatolaZ <katolaz@yahoo.it> | 2015-10-19 16:23:00 +0100 |
commit | df8386f75b0538075d72d52693836bb8878f505b (patch) | |
tree | 704c2a0836f8b9fd9f470c12b6ae05637c431468 /structure/metrics/intersect_layers.py | |
parent | 363274e79eade464247089c105260bc34940da07 (diff) |
First commit of MAMMULT code
Diffstat (limited to 'structure/metrics/intersect_layers.py')
-rw-r--r-- | structure/metrics/intersect_layers.py | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/structure/metrics/intersect_layers.py b/structure/metrics/intersect_layers.py new file mode 100644 index 0000000..a9da00c --- /dev/null +++ b/structure/metrics/intersect_layers.py @@ -0,0 +1,47 @@ +#### +## +## Take a certain number of networks as input and give as output the +## corresponding intersection graph, i.e. the graph in which an edge +## exists between i and j if and only if it exists in ALL the graphs +## given as input +## + + +import sys + + +if len(sys.argv)< 3: + print "Usage: %s <file1> <file2> [<file3>....]" % sys.argv[0] + sys.exit(1) + + +graphs = {} + +num = 0 + +for fname in sys.argv[1:]: + + lines = open(fname).readlines() + graphs[num] = [] + for l in lines: + s,d = [int(x) for x in l.strip(" \n").split(" ")][:2] + if s > d: + graphs[num].append((d,s)) + else: + graphs[num].append((d,s)) + num += 1 + +#print graphs + + +for edge in graphs[0]: + to_print = True + for i in range(1, num): + if edge not in graphs[i]: + to_print = False + break + if to_print: + s,d = edge + print s,d + + |