coauthor.py

def do_aut_distance(data, sse, aut):

	rec_do_aut_distance(sse.coauthor_network(aut), sse, [aut])

def rec_do_aut_distance(graph, sse, already_expanded_list):

	for co_aut in graph.nodes():

		if co_aut not in already_expanded_list:
			
			already_expanded_list.append(co_aut)

			new_level = sse.coauthor_network(co_aut)

			rec_do_aut_distance(graph, sse, already_expanded_list)

			# if is_subgraph(new_level, graph):
			# 	return

			for edge in new_level.edges():
				graph.add_edge(co_aut, edge[1])

			


# def is_subgraph(small, big):
# 	for edge in small.edges_iter():
# 		if not big.has_edge(edge):
# 			return False

# 	return True