图

广度遍历和深度遍历 只差一个操作。 就是用列表 存储访问过的 节点，广度遍历每次从列表前取一个元素（队列的方式）， 深度遍历每次从列表后取一个元素（栈的方式）

class Graph(object):
    '''无向图, 邻接表'''
    def __init__(self, family=None):
        self.node_neighbors = {}

    @property
    def nodes(self):
        '''所有顶点'''
        return self.node_neighbors.keys()

    def neighbors(self, u):
        '''顶点u的所有邻接点'''
        return self.node_neighbors.get(u, set())

    def add_node(self, node):
        '''添加一个顶点'''
        if not node in self.nodes:
            self.node_neighbors[node] = set()

    def add_nodes(self, nodelist):
        '''添加多个顶点'''
        for node in nodelist:
            self.add_node(node)

    def add_edge(self, edge):
        '''添加一条边'''
        u, v = edge
        if u not in self.nodes or v  not in self.nodes:
            print 'error has no node %s or %s .' % (str(u), str(v))
        self.node_neighbors.get(u).add(v)
        self.node_neighbors.get(v).add(u)

    def add_edges(self, edges):
        '''添加多条边'''
        for u, v in edges:
            self.add_edge((u,v))

    def depth_first_search(self, root=None):
        '''深度优先遍历
        用stack存储遍历过的顶点，先进后出
        '''
        stack = []
        visited = set()
        def dfs():
            while stack:
                node = stack.pop()
                visited.add(node)
                print node,
                for n in self.neighbors(node):
                    if  n not in visited:
                        stack.append(n)
                        visited.add(node)
            print '--',

        if root:
            stack.append(root)
            dfs()

        for node in self.nodes:
            if node not in visited:
                stack.append(node)
                dfs()
        print

    def breadth_first_search(self, root=None):
        '''广度优先遍历
        用queue存储遍历的过的顶点， 先进先出
        '''
        queue = []
        visited = set()
        def bfs():
            while queue:
                node = queue.pop(0)
                visited.add(node)
                print node,
                for n in self.neighbors(node):
                    if n not in visited:
                        queue.append(n)
                        visited.add(node)
            print '--',

        if root:
            queue.append(root)
            bfs()

        for node in self.nodes:
            if node not in visited:
                queue.append(node)
                bfs()
        print

    @classmethod
    def test(cls):
        g = cls()
        g.add_nodes([i for i in range(1,9)])
        print "nodes:", g.nodes

        g.add_edge((1, 2))
        g.add_edge((1, 3))
        g.add_edge((2, 3))
        g.add_edge((6, 2))
        g.add_edge((4, 5))
        g.add_edge((6, 7))
        g.add_edge((3, 5))

        print '广度遍历:',
        g.breadth_first_search(1)
        print '深度遍历:',
        g.depth_first_search(1)

Graph.test()