def test_comprehensive():
G = ModeGraph()
G.add_nodes_from([1, 2, 3, 4, 5, 6, 7, 8])
G.add_path([6, 5, 2, 1, 1], modes=[1])
G.add_path([8, 7, 4], modes=[1])
G.add_path([4, 3, 2], modes=[1])
G.add_path([1, 2, 3, 6], modes=[0])
G.add_path([5, 4, 6], modes=[0])
G.add_path([6, 7, 8, 8], modes=[0])
# Set up the mode-counting problem
cp = MultiCountingProblem(1)
cp.graphs[0] = G
cp.inits[0] = [0, 1, 6, 4, 7, 10, 2, 0]
cp.T = 5
cc1 = CountingConstraint(1)
cc1.X[0] = set(product(G.nodes(), [0]))
cc1.R = 16
cc2 = CountingConstraint(1)
cc2.X[0] = set(product(G.nodes(), [1]))
cc2.R = 30 - 15
cc3 = CountingConstraint(1)
cc3.X[0] = set(product(G.nodes_with_selfloops(), [0, 1]))
cc3.R = 0
cp.constraints += [cc1, cc2, cc3]
def outg(c):
return [G[c[i]][c[(i + 1) % len(c)]]['modes'][0]
for i in range(len(c))]
cp.cycle_sets[0] = [zip(c, outg(c))
for c in nx.simple_cycles(nx.DiGraph(G))]
cp.solve_prefix_suffix()
cp.test_solution()
xi = sum([[i + 1] * cp.inits[0][i] for i in range(8)], [])
for t in range(40):
actions = cp.get_input([xi], t)
for k1 in range(len(xi)):
xi[k1] = G.post(xi[k1], actions[0][k1])
def test_multi():
G1 = ModeGraph()
G1.add_nodes_from([1, 2, 3])
G1.add_path([1, 3, 3], modes=['on'])
G1.add_path([1, 2], modes=['off'])
G1.add_path([2, 2], modes=['on'])
# Set up the mode-counting problem
cp = MultiCountingProblem(2)
cp.T = 3
# Set up first class
cp.graphs[0] = G1
cp.inits[0] = [4, 0, 0]
cp.cycle_sets[0] = [[(3, 'on')], [(2, 'on')]]
# Set up second class
cp.graphs[1] = G1
cp.inits[1] = [4, 0, 0]
cp.cycle_sets[1] = [[(3, 'on')], [(2, 'on')]]
# Set up constraints
# Count subsystems of class 0 that are at node `2` regardless of mode
cc1 = CountingConstraint(2)
cc1.X[0] = set([(2, 'on'), (2, 'off')])
cc1.X[1] = set()
cc1.R = 0
cc2 = CountingConstraint(2)
# Count subsystems of class 1 that are at node `3` regardless of mode
cc2.X[0] = set()
cc2.X[1] = set([(3, 'on'), (3, 'off')])
cc2.R = 0
cp.constraints += [cc1, cc2]
cp.solve_prefix_suffix()
cp.test_solution()
xi = [[1, 1, 1, 1], [1, 1, 1, 1]]
for t in range(40):
actions = cp.get_input(xi, t)
for k1 in range(4):
xi[0][k1] = G1.post(xi[0][k1], actions[0][k1])
for k2 in range(4):
xi[1][k2] = G1.post(xi[1][k2], actions[1][k2])
