Esempi in Python per is_biconnected

Esempio n. 1

 def test_is_biconnected(self):
     self.assertFalse(is_biconnected(self.G))
     self.G.add_edge(Edge(4, 5))
     self.assertFalse(is_biconnected(self.G))
     self.G.add_edge(Edge(1, 2))
     self.assertFalse(is_biconnected(self.G))
     self.G.add_edge(Edge(6, 7))
     self.assertTrue(is_biconnected(self.G))

Esempio n. 2

File: timeit_mst.py Progetto: yjfiejd/graphs-dict

from graphtheory.spanningtrees.kruskal import KruskalMSTSorted

V = 50
graph_factory = GraphFactory(Graph)
G = graph_factory.make_random(V, False, 0.5)
#G = graph_factory.make_complete(V, False)
#G = graph_factory.make_cyclic(V, False)
E = G.e()
#G.show()

print "Calculate parameters ..."
print "Nodes:", G.v(), V
print "Edges:", G.e(), E
print "Directed:", G.is_directed()
print "Connected:", is_connected(G)
print "Biconnected:", is_biconnected(G)
print "Acyclic:", is_acyclic(G)
print "Bipartite:", is_bipartite(G)
Delta = max(G.degree(node) for node in G.iternodes())
print "Delta:", Delta

print "Testing BoruvkaMST ..."
t1 = timeit.Timer(lambda: BoruvkaMST(G).run())
print V, E, t1.timeit(1)  # single run

print "Testing PrimMST ..."
t1 = timeit.Timer(lambda: PrimMST(G).run())
print V, E, t1.timeit(1)  # single run

print "Testing PrimMSTWithEdges ..."
t1 = timeit.Timer(lambda: PrimMSTWithEdges(G).run())

Esempio n. 3

from graphtheory.spanningtrees.kruskal import KruskalMSTSorted

V = 10
graph_factory = GraphFactory(Graph)
G = graph_factory.make_random(V, False, 0.5)
#G = graph_factory.make_complete(V, False)
#G = graph_factory.make_cyclic(V, False)
E = G.e()
#G.show()

print "Calculate parameters ..."
print "Nodes:", G.v(), V
print "Edges:", G.e(), E
print "Directed:", G.is_directed()
print "Connected:", is_connected(G)
print "Biconnected:", is_biconnected(G)
print "Acyclic:", is_acyclic(G)
print "Bipartite:", is_bipartite(G)
Delta = max(G.degree(node) for node in G.iternodes())
print "Delta:", Delta

print "Testing BoruvkaMST ..."
t1 = timeit.Timer(lambda: BoruvkaMST(G).run())
print V, E, t1.timeit(1)            # single run

print "Testing PrimMST ..."
t1 = timeit.Timer(lambda: PrimMST(G).run())
print V, E, t1.timeit(1)            # single run

print "Testing PrimMatrixMST ..."
t1 = timeit.Timer(lambda: PrimMatrixMST(G).run())

Esempio n. 4

File: timeit_mst.py Progetto: kgashok/graphs-dict

from graphtheory.spanningtrees.kruskal import KruskalMSTSorted

V = 50
graph_factory = GraphFactory(Graph)
G = graph_factory.make_random(V, False, 0.5)
#G = graph_factory.make_complete(V, False)
#G = graph_factory.make_cyclic(V, False)
E = G.e()
#G.show()

print ( "Calculate parameters ..." )
print ( "Nodes: {} {}".format(G.v(), V) )
print ( "Edges: {} {}".format(G.e(), E) )
print ( "Directed: {}".format(G.is_directed()) )
print ( "Connected: {}".format(is_connected(G)) )
print ( "Biconnected: {}".format(is_biconnected(G)) )
print ( "Acyclic: {}".format(is_acyclic(G)) )
print ( "Bipartite: {}".format(is_bipartite(G)) )
Delta = max(G.degree(node) for node in G.iternodes())
print ( "Delta: {}".format(Delta) )

print ("Testing BoruvkaMST ..." )
t1 = timeit.Timer(lambda: BoruvkaMST(G).run())
print ( "{} {} {}".format(V, E, t1.timeit(1)) )   # single run

print ("Testing PrimMST ..." )
t1 = timeit.Timer(lambda: PrimMST(G).run())
print ( "{} {} {}".format(V, E, t1.timeit(1)) )   # single run

print ("Testing PrimMSTWithEdges ..." )
t1 = timeit.Timer(lambda: PrimMSTWithEdges(G).run())