LazyPrimMSTUnitTest

Complexity

Total Complexity

2

Size/Duplication

Total Lines	9
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	test_mst()	0	8	2

import unittest

from pyalgs.algorithms.graphs.minimum_spanning_trees import KruskalMST, LazyPrimMST
from tests.algorithms.graphs.util import create_edge_weighted_graph


class KruskalMSTUnitTest(unittest.TestCase):
    def test_mst(self):
        g = create_edge_weighted_graph()
        mst = KruskalMST(g)

        tree = mst.spanning_tree()

        for e in tree:
            print(e)

class LazyPrimMSTUnitTest(unittest.TestCase):
    def test_mst(self):
        g = create_edge_weighted_graph()
        mst = LazyPrimMST(g)

        tree = mst.spanning_tree()

        for e in tree:
            print(e)

if __name__ == '__main__':
    unittest.main()