rename src/tgbaalgos/ as src/twaalgos/

Automatic mass renaming.

* src/tgbaalgos/: Rename as...
* src/twaalgos/: ... this.
* README, configure.ac, iface/ltsmin/modelcheck.cc, src/Makefile.am,
src/bin/autfilt.cc, src/bin/common_aoutput.cc,
src/bin/common_aoutput.hh, src/bin/common_output.hh,
src/bin/common_post.hh, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc,
src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltldo.cc,
src/bin/ltlfilt.cc, src/bin/randaut.cc, src/dstarparse/dra2ba.cc,
src/dstarparse/nra2nba.cc, src/dstarparse/nsa2tgba.cc,
src/graphtest/twagraph.cc, src/kripke/kripkeprint.cc,
src/ltlvisit/contain.cc, src/ltlvisit/contain.hh,
src/ltlvisit/exclusive.cc, src/taalgos/emptinessta.hh,
src/tgbatest/checkpsl.cc, src/tgbatest/checkta.cc,
src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc,
src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc,
src/tgbatest/randtgba.cc, src/tgbatest/taatgba.cc, src/twa/twa.cc,
src/twa/twagraph.hh, src/twa/twasafracomplement.cc,
wrap/python/spot_impl.i: Adjust.

src/twaalgos/are_isomorphic.cc

@@ -0,0 +1,151 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2014, 2015 Laboratoire de Recherche et
+// Développement de l'Epita (LRDE).
+// Copyright (C) 2004, 2005  Laboratoire d'Informatique de Paris 6 (LIP6),
+// département Systèmes Répartis Coopératifs (SRC), Université Pierre
+// et Marie Curie.
+//
+// This file is part of Spot, a model checking library.
+//
+// Spot is free software; you can redistribute it and/or modify it
+// under the terms of the GNU General Public License as published by
+// the Free Software Foundation; either version 3 of the License, or
+// (at your option) any later version.
+//
+// Spot is distributed in the hope that it will be useful, but WITHOUT
+// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
+// License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+#include "twa/twagraph.hh"
+#include "twaalgos/are_isomorphic.hh"
+#include "twaalgos/canonicalize.hh"
+#include "twaalgos/isdet.hh"
+#include <vector>
+#include <queue>
+
+namespace
+{
+  typedef spot::twa_graph::graph_t::trans_storage_t tr_t;
+  bool
+  tr_t_less_than(const tr_t& t1, const tr_t& t2)
+  {
+    return t1.cond.id() < t2.cond.id();
+  }
+
+  bool
+  operator!=(const tr_t& t1, const tr_t& t2)
+  {
+    return t1.cond.id() != t2.cond.id();
+  }
+
+  bool
+  are_isomorphic_det(const spot::const_twa_graph_ptr aut1,
+                     const spot::const_twa_graph_ptr aut2)
+  {
+    typedef std::pair<unsigned, unsigned> state_pair_t;
+    std::queue<state_pair_t> workqueue;
+    workqueue.emplace(aut1->get_init_state_number(),
+                      aut2->get_init_state_number());
+    std::vector<unsigned> map(aut1->num_states(), -1U);
+    map[aut1->get_init_state_number()] = aut2->get_init_state_number();
+    std::vector<tr_t> trans1;
+    std::vector<tr_t> trans2;
+    state_pair_t current_state;
+    while (!workqueue.empty())
+      {
+        current_state = workqueue.front();
+        workqueue.pop();
+
+        for (auto& t : aut1->out(current_state.first))
+          trans1.emplace_back(t);
+        for (auto& t : aut2->out(current_state.second))
+          trans2.emplace_back(t);
+
+        if (trans1.size() != trans2.size())
+          return false;
+
+        std::sort(trans1.begin(), trans1.end(), tr_t_less_than);
+        std::sort(trans2.begin(), trans2.end(), tr_t_less_than);
+
+        for (auto t1 = trans1.begin(), t2 = trans2.begin();
+             t1 != trans1.end() && t2 != trans2.end();
+             ++t1, ++t2)
+          {
+            if (*t1 != *t2)
+              {
+                return false;
+              }
+            if (map[t1->dst] == -1U)
+              {
+                map[t1->dst] = t2->dst;
+                workqueue.emplace(t1->dst, t2->dst);
+              }
+            else if (map[t1->dst] != t2->dst)
+              {
+                return false;
+              }
+          }
+
+        trans1.clear();
+        trans2.clear();
+      }
+    return true;
+  }
+
+  bool
+  trivially_different(const spot::const_twa_graph_ptr aut1,
+                      const spot::const_twa_graph_ptr aut2)
+  {
+    return aut1->num_states() != aut2->num_states() ||
+      aut1->num_transitions() != aut2->num_transitions() ||
+      // FIXME: At some point, it would be nice to support reordering
+      // of acceptance sets (issue #58).
+      aut1->acc().get_acceptance() != aut2->acc().get_acceptance();
+  }
+}
+
+namespace spot
+{
+  isomorphism_checker::isomorphism_checker(const const_twa_graph_ptr ref)
+  {
+    ref_ = make_twa_graph(ref, twa::prop_set::all());
+    ref_deterministic_ = ref_->is_deterministic();
+    if (!ref_deterministic_)
+      {
+        nondet_states_ = spot::count_nondet_states(ref_);
+        ref_deterministic_ = (nondet_states_ == 0);
+      }
+    canonicalize(ref_);
+  }
+
+  bool
+  isomorphism_checker::is_isomorphic(const const_twa_graph_ptr aut)
+  {
+    if (trivially_different(ref_, aut))
+      return false;
+
+    if (ref_deterministic_)
+      {
+        if (aut->is_deterministic() || spot::is_deterministic(aut))
+          {
+            return are_isomorphic_det(ref_, aut);
+          }
+      }
+    else
+      {
+        if (aut->is_deterministic() ||
+            nondet_states_ != spot::count_nondet_states(aut))
+          {
+            return false;
+          }
+      }
+
+    auto tmp = make_twa_graph(aut, twa::prop_set::all());
+    spot::canonicalize(tmp);
+    return *tmp == *ref_;
+  }
+}