mln::canvas::browsing::depth_first_search_t Struct Reference
Breadth-first search algorithm for graph, on vertices. More...
#include <depth_first_search.hh>
Inheritance diagram for mln::canvas::browsing::depth_first_search_t:
Public Types | |
| typedef Browsing< void > | category |
| typedef E | exact_t |
Public Member Functions | |
| void | final () |
| void | init () |
| template<typename G, typename F> | |
| void | operator() (const Graph< G > &, F &f) const |
Detailed Description
Breadth-first search algorithm for graph, on vertices.Definition at line 79 of file depth_first_search.hh.
Member Typedef Documentation
template<typename E>
typedef Browsing<void> mln::Browsing< E >::category [inherited] |
template<typename E>
typedef E mln::Object< E >::exact_t [inherited] |
Member Function Documentation
template<typename E>
| void mln::Browsing< E >::final | ( | ) | [inline, inherited] |
Definition at line 84 of file browsing.hh.
template<typename E>
| void mln::Browsing< E >::init | ( | ) | [inline, inherited] |
Definition at line 78 of file browsing.hh.
template<typename E, template< typename T, typename Seq > class C>
template<typename G, typename F>
| void mln::canvas::browsing::internal::graph_first_search_t< E, C >::operator() | ( | const Graph< G > & | g_, | |
| F & | f | |||
| ) | const [inline, inherited] |
Definition at line 145 of file graph_first_search.hh.
References mln::trace::entering(), mln::exact(), mln::trace::exiting(), mln::util::vertex< G >::id(), mln::util::vertex< G >::ith_nbh_vertex(), mln::canvas::browsing::internal::next(), and mln::util::vertex< G >::nmax_nbh_vertices().
