shortest.hh

Go to the documentation of this file.

// shortest.hh: this file is part of the Vaucanson project.
//
// Vaucanson, a generic library for finite state machines.
//
// Copyright (C) 2008, 2009, 2010 The Vaucanson Group.
//
// This program 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 2
// of the License, or (at your option) any later version.
//
// The complete GNU General Public Licence Notice can be found as the
// `COPYING' file in the root directory.
//
// The Vaucanson Group consists of people listed in the `AUTHORS' file.
//
#ifndef VCSN_ALGORITHMS_SHORTEST_HH
# define VCSN_ALGORITHMS_SHORTEST_HH

// INTERFACE: Automaton::monoid_elt_t shortest(const Automaton& a) { return vcsn::shortest(*a); }
// INTERFACE: bool shortest(const Automaton& a, Automaton::monoid_elt_t& w) { return vcsn::shortest(*a, w); }

// INTERFACE: void enumerate(const Automaton& a, unsigned ml, std::list<Automaton::monoid_elt_t>& wl) { vcsn::enumerate(*a, ml, wl); }

#include <list>

namespace vcsn
{  
  template<typename Automaton>
  typename Automaton::monoid_elt_t
  shortest(const Automaton& autom);

  template<typename Automaton, typename MonoidElt>
  bool
  shortest(const Automaton& autom, MonoidElt& word);

  template<typename Automaton, typename MonoidElt, typename Alloc>
  void
  enumerate(const Automaton& autom, unsigned max_length,
            std::list<MonoidElt, Alloc>& word_list);

} // ! vcsn

# if !defined VCSN_USE_INTERFACE_ONLY && !defined VCSN_USE_LIB
#  include <vaucanson/algorithms/shortest.hxx>
# endif // VCSN_USE_INTERFACE_ONLY
#endif // ! VCSN_ALGORITHMS_SHORTEST_HH