Bresenham's line algorithm in Python

bresenhamalgorithm.py

class bresenham:
	def __init__(self, start, end):
		self.start = list(start)
		self.end = list(end)
		self.path = []
		
		self.steep = abs(self.end[1]-self.start[1]) > abs(self.end[0]-self.start[0])
		
		if self.steep:
			print 'Steep'
			self.start = self.swap(self.start[0],self.start[1])
			self.end = self.swap(self.end[0],self.end[1])
		
		if self.start[0] > self.end[0]:
			print 'flippin and floppin'
			_x0 = int(self.start[0])
			_x1 = int(self.end[0])
			self.start[0] = _x1
			self.end[0] = _x0
			
			_y0 = int(self.start[1])
			_y1 = int(self.end[1])
			self.start[1] = _y1
			self.end[1] = _y0
		
		dx = self.end[0] - self.start[0]
		dy = abs(self.end[1] - self.start[1])
		error = 0
		derr = dy/float(dx)
		
		ystep = 0
		y = self.start[1]
		
		if self.start[1] < self.end[1]: ystep = 1
		else: ystep = -1
		
		for x in range(self.start[0],self.end[0]+1):
			if self.steep:
				self.path.append((y,x))
			else:
				self.path.append((x,y))
			
			error += derr
			
			if error >= 0.5:
				y += ystep
				error -= 1.0
		
		print start
		print end
		print
		print self.start
		print self.end
	
	def swap(self,n1,n2):
		return [n2,n1]

l = bresenham([8,1],[6,4])
print l.path

map = []
for x in range(0,15):
	yc = []
	for y in range(0,15):
		yc.append('#')
	map.append(yc)

for pos in l.path:
	map[pos[0]][pos[1]] = '.'
	
for y in range(0,15):
	for x in range(0,15):
		print map[x][y],
	print

thank you 👍

Hello, what is the licence of this file please ?