python DFS算法求解

没有人编程求解，那我来写一个吧（恼）

就是一个广度优先搜索，没什么特别的。先贴代码，有时间再补充点思路：

分割线------------------------------------------------------------------------------------

import copy

class Node:

def __init__(self, goal=1, size=0):

self.neighbors = []

self.goal = goal

self.size = size

def __str__(self):

return f'{self.goal}-{self.size}'

def enlarge(self):

if self.size < 2:

self.size += 1

def shrink(self):

if self.size > 0:

self.size -= 1

return True

return False

def click(self):

if self.shrink():

for n in self.neighbors:

n.enlarge()

def connect(self, other):

if other is not None:

if other not in self.neighbors: self.neighbors.append(other)

if self not in other.neighbors: other.neighbors.append(self)

def disconnect(self, other):

if other is not None:

if other in self.neighbors: self.neighbors.remove(other)

if self in other.neighbors: other.neighbors.remove(self)

def Y(size):

return Node(1,size)

def P(size):

return Node(0,size)

def B(size):

return Node(2,size)

class NodeMap:

def __init__(self, nodes):

self.nodes = nodes

def __str__(self):

if self.nodes is None or len(self.nodes) == 0: return ''

return '[' + ' '.join([x.__str__() for x in self.nodes]) + ']'

def get_hash(self):

ans = 0

for n in self.nodes:

ans *= 3

ans += n.size

return ans

def satisfy(self):

for n in self.nodes:

if n.goal != n.size:

return False

return True

def update(self, index):

if 0 <= index < len(self.nodes):

new_map = copy.deepcopy(self)

new_map.nodes[index].click()

return new_map

return None

def generate_map(list):

for i in range(len(list)-1):

for j in range(len(list[0])):

if list[j] is not None: