tgbadigraph: delegate useful graph methods
* src/tgba/tgbagraph.hh (new_state, new_states, new_transitions, out, trans_data): Delegate these useful graph methods so we do not have to call get_graph(). * src/graphtest/tgbagraph.cc, src/tgbaalgos/dtbasat.cc, src/tgbaalgos/dtgbasat.cc, src/tgbaalgos/dupexp.cc, src/tgbaalgos/emptiness.cc, src/tgbaalgos/lbtt.cc, src/tgbaalgos/powerset.cc, src/tgbaalgos/randomgraph.cc, src/tgbaalgos/sccfilter.cc, src/tgbaalgos/sccinfo.cc,src/tgbaalgos/simulation.cc: Simplify.
This commit is contained in:
parent
18f6fe772b
commit
1a93166d15
12 changed files with 92 additions and 75 deletions
|
|
@ -678,8 +678,7 @@ namespace spot
|
|||
bdd acc = bdd_ithvar(autdict->register_acceptance_variable(t, a));
|
||||
a->set_acceptance_conditions(acc);
|
||||
|
||||
auto& g = a->get_graph();
|
||||
g.new_states(satdict.cand_size);
|
||||
a->new_states(satdict.cand_size);
|
||||
|
||||
unsigned last_aut_trans = -1U;
|
||||
const transition* last_sat_trans = nullptr;
|
||||
|
|
@ -717,10 +716,10 @@ namespace spot
|
|||
&& acc_states.find(t->second.src) != acc_states.end())
|
||||
accept = acc;
|
||||
|
||||
last_aut_trans = g.new_transition(t->second.src - 1,
|
||||
t->second.dst -1,
|
||||
t->second.cond,
|
||||
accept);
|
||||
last_aut_trans = a->new_transition(t->second.src - 1,
|
||||
t->second.dst - 1,
|
||||
t->second.cond,
|
||||
accept);
|
||||
last_sat_trans = &t->second;
|
||||
|
||||
dout << v << '\t' << t->second << "δ\n";
|
||||
|
|
@ -737,7 +736,7 @@ namespace spot
|
|||
assert(!state_based);
|
||||
// This assumes that the SAT solvers output
|
||||
// variables in increasing order.
|
||||
g.trans_data(last_aut_trans).acc = acc;
|
||||
a->trans_data(last_aut_trans).acc = acc;
|
||||
}
|
||||
else if (state_based)
|
||||
{
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue