![]() |
Vcsn
2.1
Be Rational
|
Struct specialization for nmin. More...
#include <distance.hh>
Public Types | |
using | automaton_t = Aut |
using | weight_t = weight_t_of< automaton_t > |
using | state_t = state_t_of< automaton_t > |
using | pair_t = std::pair< state_t, weight_t > |
Public Member Functions | |
state_distancer (const Aut &aut) | |
weight_t | operator() (state_t s0, state_t s1) const |
State distance on nmin Find weighted distance between state s0 and state s1 using a dfs. More... | |
Private Attributes | |
automaton_t | aut_ |
Struct specialization for nmin.
Definition at line 122 of file distance.hh.
using vcsn::state_distancer< Aut, nmin >::automaton_t = Aut |
Definition at line 128 of file distance.hh.
using vcsn::state_distancer< Aut, nmin >::pair_t = std::pair<state_t, weight_t> |
Definition at line 131 of file distance.hh.
using vcsn::state_distancer< Aut, nmin >::state_t = state_t_of<automaton_t> |
Definition at line 130 of file distance.hh.
using vcsn::state_distancer< Aut, nmin >::weight_t = weight_t_of<automaton_t> |
Definition at line 129 of file distance.hh.
|
inline |
Definition at line 124 of file distance.hh.
|
inline |
State distance on nmin Find weighted distance between state s0 and state s1 using a dfs.
The distance becomes a shortest path with only positive weights.
Definition at line 139 of file distance.hh.
References vcsn::state_distancer< Aut, WeightSet >::aut_, and vcsn::detail::back().
|
private |
Definition at line 177 of file distance.hh.