gui.graph.grid Class Reference

Public Member Functions
def	__init__
def	reset
def	get
def	getPath
def	neighbours
def	findPath

Public Attributes
	graph
	xs
	ys
	cols
	open

Detailed Description

Definition at line 297 of file graph.py.

Constructor & Destructor Documentation

def gui.graph.grid.__init__	(		self,
			graph
	)

Definition at line 298 of file graph.py.

  def __init__(self,graph):
    self.graph=graph
    xs=set()
    ys=set()
    xmargin=5
    ymargin=5
    for n in graph:
      h=n.height()
      w=n.width()
      x=n.x()
      y=n.y()
      xs.add(x-xmargin)
      xs.add(x+w+xmargin)
      ys.add(y-ymargin)
      ys.add(y+h+ymargin)

    xs=list(xs)
    xs.sort()
    x0=xs[0]-36
    xs.insert(0,x0)
    x0=xs[-1]+36
    xs.append(x0)

    ys=list(ys)
    ys.sort()
    y0=ys[0]-36
    ys.insert(0,y0)
    y0=ys[-1]+36
    ys.append(y0)

    self.xs=xs
    self.ys=ys
    self.cols=[]
    for w in xrange(len(xs)-1):
      col=[]
      x=(xs[w]+xs[w+1])/2
      for h in xrange(len(ys)-1):
        y=(ys[h]+ys[h+1])/2
        col.append(node((x,y),(w,h)))
      self.cols.append(col)

    for n in graph:
      h=n.height()
      w=n.width()
      x=n.x()
      y=n.y()
      l1,l2=bisect.bisect_left(ys,y-ymargin),bisect.bisect_left(ys,y+h+ymargin)
      i1,i2=bisect.bisect_left(xs,x-xmargin),bisect.bisect_left(xs,x+w+xmargin)
      for c in self.cols[i1:i2]:
        for e in c[l1:l2]:
          e.blocked=1

    #for col in self.cols:
    #  print [e.coord +(e.blocked,) for e in col]