20     template <Automaton Aut>
    34                     unsigned depth = std::numeric_limits<unsigned>::max())
    39         , 
ws_{aut->weightset().get()}
 unsigned get_depth() const
 
state_t_of< automaton_t > state_t
 
void set_depth(unsigned depth)
 
void set_weight(weight_t weight)
 
dijkstra_node(const automaton_t &aut, state_t state, state_t parent, weight_t weight=weightset_t::max(), unsigned depth=std::numeric_limits< unsigned >::max())
 
weightset_t_of< automaton_t > weightset_t
 
void set_parent(state_t parent)
 
typename detail::weightset_t_of_impl< base_t< ValueSet > >::type weightset_t_of
 
state_t get_parent() const
 
value_impl< detail::weight_tag > weight
 
state_t get_state() const
 
weight_t_of< automaton_t > weight_t
 
typename detail::state_t_of_impl< base_t< ValueSet > >::type state_t_of
 
bool operator<(const self_t &other) const
Compare weights, used to order nodes in the shortest path heap. 
 
typename detail::weight_t_of_impl< base_t< ValueSet > >::type weight_t_of
 
weight_t get_weight() const
If there is no weight in the node then its weight is the weightset's maximum. 
 
Dijkstra Node implementation.