def test_borie_iset(self):
algorithm = BorieIndependentSet(self.G)
algorithm.run()
expected1 = set([0, 3, 4, 5, 6])
self.assertEqual(algorithm.cardinality, len(expected1))
self.assertEqual(algorithm.independent_set, expected1)
# Testing iset.
for edge in self.G.iteredges():
self.assertFalse(edge.source in algorithm.independent_set
and edge.target in algorithm.independent_set)
def test_borie_iset(self):
algorithm = BorieIndependentSet(self.G)
algorithm.run()
expected1 = set([0, 3, 4, 5, 6])
self.assertEqual(algorithm.cardinality, len(expected1))
self.assertEqual(algorithm.independent_set, expected1)
# Testing iset.
for edge in self.G.iteredges():
self.assertFalse(edge.source in algorithm.independent_set
and edge.target in algorithm.independent_set)
from graphtheory.forests.treeiset import BorieIndependentSet
from graphtheory.forests.treeiset import TreeIndependentSet1
from graphtheory.forests.treeiset import TreeIndependentSet2
V = 10
E = V-1 # tree
graph_factory = GraphFactory(Graph)
G = graph_factory.make_tree(V, False)
#G.show()
print ( "Calculate parameters ..." )
print ( "Nodes: {} {}".format( G.v(), V ))
print ( "Edges: {} {}".format( G.e(), E ))
print ( "Directed: {}".format( G.is_directed() ))
algorithm = BorieIndependentSet(G)
algorithm.run()
print ( algorithm.independent_set )
print ( "borie iset []".format( algorithm.cardinality ))
algorithm = TreeIndependentSet1(G)
algorithm.run()
print ( algorithm.independent_set )
print ( "tree iset1 []".format( algorithm.cardinality ))
algorithm = TreeIndependentSet2(G)
algorithm.run()
print ( algorithm.independent_set )
print ( "tree iset2 []".format( algorithm.cardinality ))
print ( "Testing BorieIndependentSet ..." )
from graphtheory.forests.treeiset import BorieIndependentSet from graphtheory.forests.treeiset import TreeIndependentSet1 from graphtheory.forests.treeiset import TreeIndependentSet2 V = 10 E = V - 1 # tree graph_factory = GraphFactory(Graph) G = graph_factory.make_tree(V, False) #G.show() print "Calculate parameters ..." print "Nodes:", G.v(), V print "Edges:", G.e(), E print "Directed:", G.is_directed() algorithm = BorieIndependentSet(G) algorithm.run() print algorithm.independent_set print "borie iset", algorithm.cardinality algorithm = TreeIndependentSet1(G) algorithm.run() print algorithm.independent_set print "tree iset1", algorithm.cardinality algorithm = TreeIndependentSet2(G) algorithm.run() print algorithm.independent_set print "tree iset2", algorithm.cardinality print "Testing BorieIndependentSet ..."