def get_subgraph(self, states, allowed):
state_set = set(states)
assert state_set <= set([x for x in allowed])
trans = [(s, t) for s, a, t in self.transitions
if s in state_set and t in state_set and a in allowed[s]]
graph = DIGRAPH(state_set, trans)
return graph
def get_graph(self):
trans = [(s, t) for s, a, t in self.transitions]
graph = DIGRAPH(self.states, trans)
return graph