Python UnweightedGraph示例

示例#1

文件： cliques.py 项目： GeekHub-FrontEnd-CMS-Online-8/python_algorithms

                                or v not in member.get_neighbors()):
                            break
                    else:
                        clique.add(v)
                        q.append(v)
        self.cliques.add(frozenset(clique))

    def count(self):
        return len(self.cliques)

    def get_cliques(self):
        return self.cliques


if __name__ == "__main__":
    g = UnweightedGraph()
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)
    g.add_vertex(8)
    g.add_vertex(9)
    g.add_vertex(10)
    g.add_vertex(11)

    # 4 cliques in total, of size, 3, 2, 4, and 3
    g.add_edge(1, 2)
    g.add_edge(2, 1)

示例#2

                    v.marked = True
                    v.id = self.component
                    q.append(v)

    def count(self):
        return self.component

    def id(self, node):
        return self.G.get_vertex(node).id

    def connected(self, node_a, node_b):
        return self.id(node_a) == self.id(node_b)


if __name__ == "__main__":
    g = UnweightedGraph()
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)

    g.add_edge(1, 2, both=True)
    g.add_edge(2, 4, both=True)
    g.add_edge(2, 6, both=True)

    g.add_edge(3, 5, both=True)

    cc = CC(g)

示例#3

文件： cc.py 项目： kylebebak/python_algorithms

                    v.id = self.component
                    q.append(v)

    def count(self):
        return self.component

    def id(self, node):
        return self.G.get_vertex(node).id

    def connected(self, node_a, node_b):
        return self.id(node_a) == self.id(node_b)



if __name__ == '__main__':
    g = UnweightedGraph()
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)

    g.add_edge(1,2, both=True)
    g.add_edge(2,4, both=True)
    g.add_edge(2,6, both=True)

    g.add_edge(3,5, both=True)

示例#4

文件： cliques.py 项目： kylebebak/python_algorithms

                            break
                    else:
                        clique.add(v)
                        q.append(v)
        self.cliques.add(frozenset(clique))

    def count(self):
        return len(self.cliques)

    def get_cliques(self):
        return self.cliques



if __name__ == '__main__':
    g = UnweightedGraph()
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)
    g.add_vertex(8)
    g.add_vertex(9)
    g.add_vertex(10)
    g.add_vertex(11)


    # 4 cliques in total, of size, 3, 2, 4, and 3
    g.add_edge(1,2)

示例#5

文件： dfo.py 项目： kylebebak/python_algorithms

    def __init__(self, G):
        self.G = G
        self.post = []
        for v in G:
            v.marked = False
        for v in G:
            if not v.marked:
                self.dfs(G, v)

    def dfs(self, G, source):
        source.marked = True
        for v in source.get_neighbors():
            if not v.marked:
                self.dfs(G, v)
        self.post.append(source)

    def __iter__(self):
        return iter(reversed(self.post))



if __name__ == '__main__':
    g = UnweightedGraph()
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)

示例#6

文件： scc.py 项目： GeekHub-FrontEnd-CMS-Online-8/python_algorithms

                    v.marked = True
                    v.id = self.component
                    q.append(v)

    def count(self):
        return self.component

    def id(self, node):
        return self.G.get_vertex(node).id

    def connected(self, node_a, node_b):
        return self.id(node_a) == self.id(node_b)


if __name__ == "__main__":
    g = UnweightedGraph()
    g.add_vertex(0)
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)
    g.add_vertex(8)
    g.add_vertex(9)
    g.add_vertex(10)
    g.add_vertex(11)
    g.add_vertex(12)

    # 5 strongly connected components

示例#7

文件： dfo.py 项目： GeekHub-FrontEnd-CMS-Online-8/python_algorithms

    def __init__(self, G):
        self.G = G
        self.post = []
        for v in G:
            v.marked = False
        for v in G:
            if not v.marked:
                self.dfs(G, v)

    def dfs(self, G, source):
        source.marked = True
        for v in source.get_neighbors():
            if not v.marked:
                self.dfs(G, v)
        self.post.append(source)

    def __iter__(self):
        return iter(reversed(self.post))


if __name__ == "__main__":
    g = UnweightedGraph()
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)

示例#8

文件： scc.py 项目： kylebebak/python_algorithms

                    v.id = self.component
                    q.append(v)

    def count(self):
        return self.component

    def id(self, node):
        return self.G.get_vertex(node).id

    def connected(self, node_a, node_b):
        return self.id(node_a) == self.id(node_b)



if __name__ == '__main__':
    g = UnweightedGraph()
    g.add_vertex(0)
    g.add_vertex(1)
    g.add_vertex(2)
    g.add_vertex(3)
    g.add_vertex(4)
    g.add_vertex(5)
    g.add_vertex(6)
    g.add_vertex(7)
    g.add_vertex(8)
    g.add_vertex(9)
    g.add_vertex(10)
    g.add_vertex(11)
    g.add_vertex(12)

    # 5 strongly connected components