|
Vaucanson 1.4
|
00001 // shortest.hh: this file is part of the Vaucanson project. 00002 // 00003 // Vaucanson, a generic library for finite state machines. 00004 // 00005 // Copyright (C) 2008, 2009, 2010 The Vaucanson Group. 00006 // 00007 // This program is free software; you can redistribute it and/or 00008 // modify it under the terms of the GNU General Public License 00009 // as published by the Free Software Foundation; either version 2 00010 // of the License, or (at your option) any later version. 00011 // 00012 // The complete GNU General Public Licence Notice can be found as the 00013 // `COPYING' file in the root directory. 00014 // 00015 // The Vaucanson Group consists of people listed in the `AUTHORS' file. 00016 // 00017 #ifndef VCSN_ALGORITHMS_SHORTEST_HH 00018 # define VCSN_ALGORITHMS_SHORTEST_HH 00019 00034 // INTERFACE: Automaton::monoid_elt_t shortest(const Automaton& a) { return vcsn::shortest(*a); } 00035 // INTERFACE: bool shortest(const Automaton& a, Automaton::monoid_elt_t& w) { return vcsn::shortest(*a, w); } 00036 00037 // INTERFACE: void enumerate(const Automaton& a, unsigned ml, std::list<Automaton::monoid_elt_t>& wl) { vcsn::enumerate(*a, ml, wl); } 00038 00039 #include <list> 00040 00041 namespace vcsn 00042 { 00059 template<typename Automaton> 00060 typename Automaton::monoid_elt_t 00061 shortest(const Automaton& autom); 00062 00077 template<typename Automaton, typename MonoidElt> 00078 bool 00079 shortest(const Automaton& autom, MonoidElt& word); 00080 00097 template<typename Automaton, typename MonoidElt, typename Alloc> 00098 void 00099 enumerate(const Automaton& autom, unsigned max_length, 00100 std::list<MonoidElt, Alloc>& word_list); 00101 00104 } // ! vcsn 00105 00106 # if !defined VCSN_USE_INTERFACE_ONLY && !defined VCSN_USE_LIB 00107 # include <vaucanson/algorithms/shortest.hxx> 00108 # endif // VCSN_USE_INTERFACE_ONLY 00109 #endif // ! VCSN_ALGORITHMS_SHORTEST_HH
1.7.4