![]() |
Vcsn
2.5
Be Rational
|
Shortest Path Tree. More...
#include <shortest-path-tree.hh>
Public Member Functions | |
shortest_path_tree (const automaton_t &aut, state_t root) | |
void | add (const dijkstra_node_t &n) |
void | set_parent_of (state_t s, state_t parent) |
weight_t | get_weight_of (state_t s) |
dijkstra_node_t & | get_node_of (state_t s) |
state_t | get_parent_of (state_t s) |
state_t | get_parent_of (state_t s) const |
state_t | get_root () const |
dijkstra_node_t & | operator[] (state_t s) |
Private Types | |
using | automaton_t = Aut |
using | state_t = state_t_of< automaton_t > |
using | weight_t = weight_t_of< automaton_t > |
using | dijkstra_node_t = dijkstra_node< automaton_t > |
using | dijkstra_map_t = std::unordered_map< state_t, dijkstra_node_t > |
Private Attributes | |
dijkstra_map_t | states_ |
state_t | root_ |
const automaton_t & | aut_ |
Shortest Path Tree.
Represents the tree of nodes in the graph with each node's parent being their lightest successor in the automaton (the path is computed from destination to source).
Definition at line 18 of file shortest-path-tree.hh.
|
private |
Definition at line 20 of file shortest-path-tree.hh.
|
private |
Definition at line 24 of file shortest-path-tree.hh.
|
private |
Definition at line 23 of file shortest-path-tree.hh.
|
private |
Definition at line 21 of file shortest-path-tree.hh.
|
private |
Definition at line 22 of file shortest-path-tree.hh.
|
inline |
Definition at line 27 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::aut_.
|
inline |
Definition at line 33 of file shortest-path-tree.hh.
References vcsn::detail::dijkstra_node< Aut >::state_, and vcsn::detail::shortest_path_tree< Aut >::states_.
|
inline |
Definition at line 58 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::aut_, and vcsn::detail::shortest_path_tree< Aut >::states_.
Referenced by vcsn::detail::compute_shortest_path_tree().
|
inline |
Definition at line 71 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::states_.
Referenced by vcsn::detail::eppstein< Aut >::add_children_to_queue_(), and vcsn::detail::implicit_path< Aut >::explicit_path().
|
inline |
Definition at line 81 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::states_.
|
inline |
Definition at line 91 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::root_.
Referenced by vcsn::detail::implicit_path< Aut >::explicit_path().
|
inline |
Definition at line 48 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::aut_, and vcsn::detail::shortest_path_tree< Aut >::states_.
Referenced by vcsn::detail::eppstein< Aut >::add_children_to_queue_().
|
inline |
Definition at line 96 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::states_.
|
inline |
Definition at line 39 of file shortest-path-tree.hh.
References vcsn::detail::shortest_path_tree< Aut >::aut_, vcsn::has(), and vcsn::detail::shortest_path_tree< Aut >::states_.
|
private |
Definition at line 104 of file shortest-path-tree.hh.
Referenced by vcsn::detail::shortest_path_tree< Aut >::get_node_of(), vcsn::detail::shortest_path_tree< Aut >::get_weight_of(), vcsn::detail::shortest_path_tree< Aut >::set_parent_of(), and vcsn::detail::shortest_path_tree< Aut >::shortest_path_tree().
|
private |
Definition at line 103 of file shortest-path-tree.hh.
Referenced by vcsn::detail::shortest_path_tree< Aut >::get_root().
|
private |
Definition at line 102 of file shortest-path-tree.hh.
Referenced by vcsn::detail::shortest_path_tree< Aut >::add(), vcsn::detail::shortest_path_tree< Aut >::get_node_of(), vcsn::detail::shortest_path_tree< Aut >::get_parent_of(), vcsn::detail::shortest_path_tree< Aut >::get_weight_of(), vcsn::detail::shortest_path_tree< Aut >::operator[](), and vcsn::detail::shortest_path_tree< Aut >::set_parent_of().