# readdata.py 
# 11/19/03
# Jiwon Hahn

N = 100 #number of node in a graph

class Graph:
	def __init__(self, L):
		self.G = L
	def cost(self, u, v):
		return self.G[u][v]
	def adj(self, u):
		return self.G[u].keys()
	def V(self):
		return self.G.keys()
	def totalcost(self):
		C = 0
		for v in self.G.keys():
			for a in self.G[v].keys():
				C += self.G[v][a] 
		return C		

def get_graph1(): #use class Graph data structure
	graph = {}
	f = open("pro3.dat",'r')
	f.readline() #skip first line
	data = f.read().split()
	for i in range(N):
		graph[i]={}
		data.pop(0) #drop the first number (node index)
		for j in range(i,N):
			edge = int(data.pop(0))
			if  edge > 0: #add only if greater than 0
				graph[i][j]=edge  
	f.close()
	return Graph(graph)

def get_graph2(): #use 2-D array
	graph = [[] for i in range(N)]
	f = open("pro3.dat",'r')
	f.readline() #skip first line
	data = f.read().split()
	for i in range(0,N):
		data.pop(0)
		for j in range(N):
			if j<i:
				graph[i].append(graph[j][i])
			else:
				graph[i].append(int(data.pop(0)))
	f.close()
	return graph


if __name__=='__main__':
	g = get_graph1()
	print 'Total cost of graph:',g.totalcost()
	g2 = get_graph2()	
	print g.cost(8,13)
	print g2[13][8], g2[8][13]