def full_dag(size):
g = nx.DiGraph()
for i in xrange(size):
for j in xrange(i + 1, size):
g.add_edge(i, j)
utilities.add_uniform_distr_probs_to_out_edges(g)
g.source = 0
g.sink = size - 1
return g
def test_generate_path_should_raise_when_find_cycle(self):
g = nx.cycle_graph(5, nx.DiGraph())
mc.add_uniform_distr_probs_to_out_edges(g)
[source, sink] = random.sample(g.nodes(), 2)
self.assertRaises(s.CycleDetectedError, lambda : s.generate_path(g, source, sink))
def setUp(self):
self.path_graph = nx.path_graph(5, nx.DiGraph())
mc.add_uniform_distr_probs_to_out_edges(self.path_graph)
self.path_graph_sources = mc.select_sources_list(self.path_graph)
self.path_graph_sinks = mc.select_sinks_list(self.path_graph)
