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 depth_first_search_t | exact_t |
Public Member Functions | |
| void | final () |
| void | init () |
| void | operator() (const Graph< G > &, F &f) const |
Detailed Description
Breadth-first search algorithm for graph, on vertices.
Definition at line 80 of file depth_first_search.hh.
Member Typedef Documentation
typedef Browsing<void> mln::Browsing< depth_first_search_t >::category [inherited] |
Reimplemented from mln::Object< depth_first_search_t >.
Definition at line 58 of file browsing.hh.
typedef depth_first_search_t mln::Object< depth_first_search_t >::exact_t [inherited] |
Member Function Documentation
| void mln::Browsing< depth_first_search_t >::final | ( | ) | [inherited] |
| void mln::Browsing< depth_first_search_t >::init | ( | ) | [inherited] |
| void mln::canvas::browsing::internal::graph_first_search_t< depth_first_search_t , std::stack >::operator() | ( | const Graph< G > & | , | |
| F & | f | |||
| ) | const [inherited] |
