matrix representation of a graph

derp.py

def mkmatrix(size):
	matrix = []
	for _ in xrange(size):
		matrix.append([False] * size)
	return matrix

def addedge(matrix, nodea, nodeb):
	matrix[nodea][nodeb] = True
	matrix[nodeb][nodea] = True

def hasedge(matrix, nodea, nodeb):
	return matrix[nodea][nodeb]

matrix = mkmatrix(10)
node1 = 1
node2 = 2
node3 = 3

addedge(matrix, node1, node2)

print hasedge(matrix, node1, node2)
print hasedge(matrix, node1, node3)