def test_maximal_independent_set(self):
# test that method works with diagonal entries
assert_equal(maximal_independent_set(np.eye(2)), [1, 1])
for algo in ['serial', 'parallel']:
for G in self.cases:
mis = maximal_independent_set(G, algo=algo)
assert_is_mis(G, mis)
def test_maximal_independent_set(self):
# test that method works with diagonal entries
assert_equal(maximal_independent_set(eye(2)), [1, 1])
for algo in ['serial', 'parallel']:
for G in self.cases:
mis = maximal_independent_set(G, algo=algo)
assert_is_mis(G, mis)
def test_maximal_independent_set(self):
# test that method works with diagonal entries
assert_equal(maximal_independent_set(np.eye(2)), [1, 1])
for algo in ['serial', 'parallel']:
for G in self.cases:
mis = maximal_independent_set(G, algo=algo)
assert_is_mis(G, mis)
for G in self.cases:
for k in [1, 2, 3, 4]:
mis = maximal_independent_set(G, k=k)
if k > 1:
G = (G + np.eye(G.shape[0]))**k
G = canonical_graph(G)
assert_is_mis(G, mis)
def test_maximal_independent_set(self):
# test that method works with diagonal entries
assert_equal(maximal_independent_set(eye(2)), [1, 1])
for algo in ['serial', 'parallel']:
for G in self.cases:
mis = maximal_independent_set(G, algo=algo)
assert_is_mis(G, mis)
for G in self.cases:
for k in [1, 2, 3, 4]:
mis = maximal_independent_set(G, k=k)
if k > 1:
G = (G + eye(G.shape[0]))**k
G = canonical_graph(G)
assert_is_mis(G, mis)
