class TestSymmEdgePairGraph(unittest.TestCase): def setUp(self): self.G = SymmEdgePairGraph(PAIRS) def test_copy(self): gg = self.G.copy() self.assertIsNot(gg, self.G) assert_array_equal(gg.matrix(dense=True), self.G.matrix(dense=True)) assert_array_equal(gg.pairs(), self.G.pairs()) def test_pairs(self): expected = [[0,1], [0,2], [1,0], [1,1], [1,2], [2,0], [2,1], [3,3]] P = self.G.pairs() assert_array_equal(sorted(P.tolist()), expected) # test the directed case P = self.G.pairs(directed=False) assert_array_equal(P, [[0,1],[0,2],[1,1],[1,2],[3,3]]) def test_symmetrize(self): self.assertIs(self.G.symmetrize(copy=False), self.G) S = self.G.symmetrize(copy=True) self.assertIsNot(S, self.G) assert_array_equal(S.matrix(dense=True), self.G.matrix(dense=True))
class TestSymmEdgePairGraph(unittest.TestCase): def setUp(self): self.G = SymmEdgePairGraph(PAIRS) def test_copy(self): gg = self.G.copy() self.assertIsNot(gg, self.G) assert_array_equal(gg.matrix('dense'), self.G.matrix('dense')) assert_array_equal(gg.pairs(), self.G.pairs()) def test_pairs(self): expected = [[0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [3, 3]] P = self.G.pairs() assert_array_equal(sorted(P.tolist()), expected) # test the directed case P = self.G.pairs(directed=False) assert_array_equal(P, [[0, 1], [0, 2], [1, 1], [1, 2], [3, 3]]) def test_symmetrize(self): self.assertIs(self.G.symmetrize(copy=False), self.G) S = self.G.symmetrize(copy=True) self.assertIsNot(S, self.G) assert_array_equal(S.matrix('dense'), self.G.matrix('dense'))
def setUp(self): self.G = SymmEdgePairGraph(PAIRS)