| | |
| | | import unittest |
| | | |
| | | from graphdemo import Graph |
| | | from src.graphdemo import greedy_color |
| | | |
| | | |
| | | class GraphTestCase(unittest.TestCase): |
| | |
| | | pass |
| | | pass |
| | | |
| | | def test_greedy_color(self): |
| | | g = Graph() |
| | | g.add_edges(0, [1, 2, 3]) |
| | | g.add_edges(1, [0, 3, 2]) |
| | | g.add_edges(2, [0, 1]) |
| | | g.add_edges(3, [1]) |
| | | print(g) |
| | | vertices = [1, 3, 0, 2] |
| | | colors = greedy_color(g, vertices) |
| | | print(colors) |
| | | |
| | | def test_greedy_color_2(self): |
| | | g = Graph() |
| | | g.add_edges(0, [1,2, 3]) |
| | | g.add_edges(1, [0, 2, 4]) |
| | | g.add_edges(2, [0, 1, 5]) |
| | | g.add_edges(3, [0, 4, 5]) |
| | | g.add_edges(4, [1, 3, 5]) |
| | | g.add_edges(5, [2, 3, 4]) |
| | | print(g) |
| | | vertices = [0, 3, 4, 2, 5, 1] |
| | | #vertices = [0, 5, 3, 4, 2, 1] |
| | | colors = greedy_color(g, vertices) |
| | | print(colors) |
| | | for vertex in g.vertices(): |
| | | color = colors[vertex] |
| | | for nbr in g.adjacent_of(vertex): |
| | | self.assertNotEqual(color, colors[nbr]) |
| | | |
| | | |
| | | if __name__ == '__main__': |
| | | unittest.main() |