File: test_spectral.py

package info (click to toggle)
python-igraph 0.11.8%2Bds-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 3,480 kB
  • sloc: ansic: 24,545; python: 21,699; sh: 107; makefile: 35; sed: 2
file content (109 lines) | stat: -rw-r--r-- 3,247 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
# vim:set ts=4 sw=4 sts=4 et:
import unittest

from igraph import Graph


class SpectralTests(unittest.TestCase):
    def assertAlmostEqualMatrix(self, mat1, mat2, eps=1e-7):
        self.assertTrue(
            all(abs(obs - exp) < eps for obs, exp in zip(sum(mat1, []), sum(mat2, [])))
        )

    def testLaplacian(self):
        g = Graph.Full(3)
        g.es["weight"] = [1, 2, 3]
        self.assertTrue(g.laplacian() == [[2, -1, -1], [-1, 2, -1], [-1, -1, 2]])
        self.assertAlmostEqualMatrix(
            g.laplacian(normalized=True),
            [[1, -0.5, -0.5], [-0.5, 1, -0.5], [-0.5, -0.5, 1]],
        )
        self.assertAlmostEqualMatrix(
            g.laplacian(normalized="symmetric"),
            [[1, -0.5, -0.5], [-0.5, 1, -0.5], [-0.5, -0.5, 1]],
        )
        self.assertAlmostEqualMatrix(
            g.laplacian(normalized="left"),
            [[1, -0.5, -0.5], [-0.5, 1, -0.5], [-0.5, -0.5, 1]],
        )
        self.assertAlmostEqualMatrix(
            g.laplacian(normalized="right"),
            [[1, -0.5, -0.5], [-0.5, 1, -0.5], [-0.5, -0.5, 1]],
        )

        mx0 = [
            [1.0, -1 / (12**0.5), -2 / (15**0.5)],
            [-1 / (12**0.5), 1.0, -3 / (20**0.5)],
            [-2 / (15**0.5), -3 / (20**0.5), 1.0],
        ]
        self.assertAlmostEqualMatrix(g.laplacian("weight", True), mx0)

        g = Graph.Tree(5, 2)
        g.add_vertices(1)
        self.assertTrue(
            g.laplacian()
            == [
                [2, -1, -1, 0, 0, 0],
                [-1, 3, 0, -1, -1, 0],
                [-1, 0, 1, 0, 0, 0],
                [0, -1, 0, 1, 0, 0],
                [0, -1, 0, 0, 1, 0],
                [0, 0, 0, 0, 0, 0],
            ]
        )

        g = Graph.Formula("A --> B --> C --> D --> E --> A, A --> C")
        self.assertAlmostEqualMatrix(
            g.laplacian(mode="out"),
            [
                [2, -1, -1, 0, 0],
                [0, 1, -1, 0, 0],
                [0, 0, 1, -1, 0],
                [0, 0, 0, 1, -1],
                [-1, 0, 0, 0, 1],
            ],
        )
        self.assertAlmostEqualMatrix(
            g.laplacian(mode="in"),
            [
                [1, -1, -1, 0, 0],
                [0, 1, -1, 0, 0],
                [0, 0, 2, -1, 0],
                [0, 0, 0, 1, -1],
                [-1, 0, 0, 0, 1],
            ],
        )
        self.assertAlmostEqualMatrix(
            g.laplacian(mode="out", normalized="left"),
            [
                [1, -0.5, -0.5, 0, 0],
                [0, 1, -1, 0, 0],
                [0, 0, 1, -1, 0],
                [0, 0, 0, 1, -1],
                [-1, 0, 0, 0, 1],
            ],
        )
        self.assertAlmostEqualMatrix(
            g.laplacian(mode="in", normalized="right"),
            [
                [1, -1, -0.5, 0, 0],
                [0, 1, -0.5, 0, 0],
                [0, 0, 1, -1, 0],
                [0, 0, 0, 1, -1],
                [-1, 0, 0, 0, 1],
            ],
        )


def suite():
    spectral_suite = unittest.defaultTestLoader.loadTestsFromTestCase(SpectralTests)
    return unittest.TestSuite([spectral_suite])


def test():
    runner = unittest.TextTestRunner()
    runner.run(suite())


if __name__ == "__main__":
    test()