'''
Question:
1)How to get scale free graph and how to store it in the memory.
2)Is making 3d array the best way to do it?
3)Who will be the first speaker?
4)What to do after we propagate the first work once through the graph.
5)BFS vs DFS while naming the peers?
6)Do we have to delete memory when the success event occurs?
'''
graph = [
			[1,1,1,0,1,1,0],
			[1,1,1,0,1,1,0],
			[1,1,1,0,1,1,0],
			[1,1,1,0,1,1,0],
			[1,1,1,0,1,1,0],
			[1,1,1,0,1,1,0],
			[1,1,1,0,1,1,0],
		]
memory = []

#add word to listners memory
def store_word(node_number, word):
	memory[node_number].append(word)

#check if the word exists in listner's memory
def word_exists(node_number, word):
	if word in node[node_number]:
		return True
	else:
		return False

#check if two memory are connected
def is_peer(node_number1,node_number2):
	if graph[node_number1][node_number2] == 1:
		return True
	else:
		return False

#create memory blocks for each node in the graph
def init_memory(graph):
	for x in range(0,len(graph)):
		memory.append([])

def success(speaker,listner,word):
	memory[speaker][:] = [word]
	memory[listner][:] = [word]

def propagate(speaker,word):
	peers = []
	memory[speaker].append(word)
	for x in range(0,len(graph)):
		if graph[speaker][x] == 1:
			peers.append(x)
			store_word(x,word)