Example #1
0
 def rmttest_inherit_003(self):
     "Topological sort check"
     mg = create_test_graph_01()
     tsort = topological_sort(mg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == ['C', 'B', 'A'], \
         "incorrect topological sort"
Example #2
0
 def test_inherit_003(self):
     "Topological sort check"
     mg = create_test_graph_01()
     tsort = topological_sort(mg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['C', 'B', 'A'],
                      "incorrect topological sort")
Example #3
0
 def test_tsort_005(self):
     "Digraph with two components"
     dg = digraph_create_from_dict( {"A": ["B", "C"], "B": ["C"], "C": [],
                    "D": ["E"], "E": [] } )
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['C', 'B', 'A', 'E', 'D'], "incorrect")
Example #4
0
 def rmttest_inherit_003(self):
     "Topological sort check"
     mg = create_test_graph_01()
     tsort = topological_sort(mg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == ['C', 'B', 'A'], \
         "incorrect topological sort"
Example #5
0
 def test_tsort_004(self):
     "More complex digraph"
     dg = Digraph( {"A": ["B", "C"], "B": ["C", "E"], "C": ["D", "E"],
                    "D": [], "E": [] } )
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['D', 'E', 'C', 'B', 'A'], "incorrect")
Example #6
0
    def rmttest_tsort_005(self):
        "Digraph with two components"
        dg = Digraph({"A": ["B", "C"], "B": ["C"], "C": [],
                      "D": ["E"], "E": []})
        tsort = topological_sort(dg)
        tnames = node_list_to_node_name_list(tsort)

        # There is no 'fixed' result - depending on the python
        # implementation different correct values are computed.
        assert self.__list_order(tnames, "B", "A")
        assert self.__list_order(tnames, "C", "A")
        assert self.__list_order(tnames, "E", "D")
Example #7
0
    def rmttest_tsort_005(self):
        "Digraph with two components"
        dg = Digraph({"A": ["B", "C"], "B": ["C"], "C": [],
                      "D": ["E"], "E": []})
        tsort = topological_sort(dg)
        tnames = node_list_to_node_name_list(tsort)

        # There is no 'fixed' result - depending on the python
        # implementation different correct values are computed.
        assert self.__list_order(tnames, "B", "A")
        assert self.__list_order(tnames, "C", "A")
        assert self.__list_order(tnames, "E", "D")
Example #8
0
 def test_tsort_005(self):
     "Digraph with two components"
     dg = digraph_create_from_dict({
         "A": ["B", "C"],
         "B": ["C"],
         "C": [],
         "D": ["E"],
         "E": []
     })
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['C', 'B', 'A', 'E', 'D'], "incorrect")
Example #9
0
 def test_tsort_004(self):
     "More complex digraph"
     dg = digraph_create_from_dict({
         "A": ["B", "C"],
         "B": ["C", "E"],
         "C": ["D", "E"],
         "D": ["E"],
         "E": []
     })
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['E', 'D', 'C', 'B', 'A'], "incorrect")
Example #10
0
 def rmttest_tsort_004(self):
     "More complex digraph"
     dg = Digraph({
         "A": ["B", "C"],
         "B": ["C", "E"],
         "C": ["D", "E"],
         "D": [],
         "E": []
     })
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     # There is no 'fixed' result - depending on the python
     # implementation different correct values are computed.
     self.assertTrue(self.__list_order(tnames, "D", "C"))
     self.assertTrue(self.__list_order(tnames, "E", "C"))
     self.assertTrue(self.__list_order(tnames, "E", "B"))
     self.assertTrue(self.__list_order(tnames, "C", "B"))
     self.assertTrue(self.__list_order(tnames, "C", "A"))
     self.assertTrue(self.__list_order(tnames, "B", "A"))
Example #11
0
 def rmttest_tsort_003(self):
     "One node digraph"
     dg = Digraph({"A": []})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == ["A"], "incorrect"
Example #12
0
 def rmttest_tsort_002(self):
     "Zero node digraph"
     dg = Digraph({})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == [], "incorrect"
Example #13
0
 def rmttest_tsort_001(self):
     "Simple three node digraph"
     dg = Digraph({"A": ["B", "C"], "B": ["C"], "C": []})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == ['C', 'B', 'A'], "incorrect"
Example #14
0
 def test_inherit_003(self):
     "Topological sort check"
     mg = create_test_graph_01()
     tsort = topological_sort(mg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['C', 'B', 'A'], "incorrect topological sort")
Example #15
0
 def test_tsort_002(self):
     "Zero node digraph"
     dg = digraph_create_from_dict({})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, [], "incorrect")
Example #16
0
 def test_tsort_003(self):
     "One node digraph"
     dg = digraph_create_from_dict( {"A": [] } )
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ["A"], "incorrect")
Example #17
0
 def test_tsort_001(self):
     "Simple three node digraph"
     dg = digraph_create_from_dict( {"A": ["B", "C"], "B": ["C"], "C": [] } )
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['C', 'B', 'A'], "incorrect")
Example #18
0
 def test_tsort_003(self):
     "One node digraph"
     dg = digraph_create_from_dict({"A": []})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ["A"], "incorrect")
Example #19
0
 def test_simple_02(self):
     "Module test with dependend modules"
     mods = Modules(os.path.join(mod_base_dir, "modules02"),
                    {}, {}, [], mods_list("modules02", mod_base_dir))
     mods_name = node_list_to_node_name_list(mods.reqdeps_sorted)
     assert(mods_name==['Module01', 'Module02'])
Example #20
0
 def rmttest_tsort_001(self):
     "Simple three node digraph"
     dg = Digraph({"A": ["B", "C"], "B": ["C"], "C": []})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == ['C', 'B', 'A'], "incorrect"
Example #21
0
 def test_tsort_001(self):
     "Simple three node digraph"
     dg = digraph_create_from_dict({"A": ["B", "C"], "B": ["C"], "C": []})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, ['C', 'B', 'A'], "incorrect")
Example #22
0
 def test_tsort_002(self):
     "Zero node digraph"
     dg = digraph_create_from_dict( {} )
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     self.assertEqual(tnames, [], "incorrect")
Example #23
0
 def rmttest_tsort_002(self):
     "Zero node digraph"
     dg = Digraph({})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == [], "incorrect"
Example #24
0
 def rmttest_tsort_003(self):
     "One node digraph"
     dg = Digraph({"A": []})
     tsort = topological_sort(dg)
     tnames = node_list_to_node_name_list(tsort)
     assert tnames == ["A"], "incorrect"
Example #25
0
 def test_simple_02(self):
     "Module test with dependent modules"
     mods = InputModules(os.path.join(mod_base_dir, "modules02"), {}, [],
                         mods_list("modules02", mod_base_dir))
     mods_name = node_list_to_node_name_list(mods.get_reqdeps_sorted())
     assert (mods_name == ['Module01', 'Module02'])