def test_start_node_with_one_degree(self):
graph = {
# 0 and 1 are sink nodes
2: [0, 1],
3: [2],
}
start_node = 3
self.assertEqual(bhf.reachable_nodes_in_order(start_node, graph), [0, 1, 2])
def test_start_node_with_more_than_one_degree(self):
graph = {2: [0, 1], 3: [1], 4: [2, 3], 5: [3, 2, 4]}
start_node = 5
self.assertEqual(bhf.reachable_nodes_in_order(start_node, graph), [1, 3, 0, 2, 4])
def test_sink_node(self):
graph = {}
start_node = 2
self.assertEqual(bhf.reachable_nodes_in_order(start_node, graph), [])
