Python 非递归遍历图

class Queue:
    def __init__(self,max_size):
        self.max_size = int(max_size)
        self.queue = []

    def put(self,data):
        if self.max_size > 0:
            if self.full():
                raise ValueError(‘Queue is full!‘)
            else:
                self._put(data)

    def get(self):
        if self._queue_size() > 0:
            result = self._get()
            empty_flag = False
        else:
            result = None
            empty_flag = True
        return result

    def empty(self):
        if self._queue_size() == 0:
            return True
        else:
            return False

    def full(self):
        if self._queue_size() == self.max_size:
            return True
        else:
            return False

    def _put(self,data):
        self.queue.append(data)

    def _get(self):
        result = self.queue[0]
        self.queue.pop(0)
        return result

    def _queue_size(self):
        return len(self.queue)

def travel_dbfs(self,first_node):#图的深度遍历
    stack_lsit = []
    visited = []
    stack_lsit.append(first_node)
    visited.append(first_node)
    while len(stack_lsit) > 0:
        x = stack_lsit[-1]
        for w in x.neighbor_list:
            if not w in visited:
                print(w.data)
                visited.append(w)
                stack_lsit.append(w)
                break
        if stack_lsit[-1] == x:
            stack_lsit.pop()

def travel_bfs(self,first_node):#图的广度遍历
    queue = Queue(100000)
    visited = []
    queue.put(first_node)
    visited.append(first_node)
    while not queue.empty():
        v =queue.get()
        i = 1
        try:
            w=v.neighbor_list[i]
        except IndexError:
            w = None
        while w:
            if not w in visited:
                print(w.name)
                visited.append(w)
                queue.put(w)
                i = i+1
                try:
                    w = v.neighbor_list[i]
                except IndexError:
                    w = None
                        
class GraphNode:
    def __init__(self,data):
        self.neighbor_list = []
        self.data = data