graph_test.py 文件源码

def testTopologicalSort(self):
        r = Vertex('r')    
        s = Vertex('s')    
        t = Vertex('t')    
        x = Vertex('x')    
        y = Vertex('y')    
        z = Vertex('z')    
        vertices = [r, s, t, x, y, z]
        edges = [(r, s), (r, t), (s, t), (s, x), (t, x), (t, y), (t, z), (x, y), (x, z), (y, z)]
        G = Graph(vertices, edges)
        l = G.topological_sort()
        self.assertEquals(l, [r, s, t, x, y, z])

        result = []
        l = [self.v1, self.v2, self.v3, self.v4, self.v5, self.v6]
        result.append(l)
        for i in range(len(self.graphs)):
            self.assertEquals(self.graphs[i].topological_sort(), result[i])