def buildTriangleGraphFromTxt(txtFileName):
triangleTree = networkx.DiGraph()
with open(txtFileName) as triangleInputFile:
weightNumber = 0
sourceNodeNumber = 0
triangleSeed = 0
nextTriangleNumber = EulerUtilities.generateTriangle(triangleSeed)
for line in triangleInputFile:
splitLine = line.split()
for edgeWeight in splitLine:
if weightNumber == nextTriangleNumber:
sourceNodeNumber += 1
triangleSeed += 1
nextTriangleNumber = EulerUtilities.generateTriangle(triangleSeed)
triangleTree.add_edge(weightNumber, sourceNodeNumber, {'capacity': int(edgeWeight)})
sourceNodeNumber += 1
triangleTree.add_edge(weightNumber, sourceNodeNumber, {'capacity': int(edgeWeight)})
weightNumber += 1
return triangleTree, EulerUtilities.generateTriangle(triangleSeed)
import EulerUtilities
for x in xrange(100):
print EulerUtilities.getPrimeDecomposition(x)
