#include <graph.h>
Inheritance diagram for breath_first_iter< GRAPH, ITERATOR, VISITED >:
Collaboration diagram for breath_first_iter< GRAPH, ITERATOR, VISITED >:
Public Types | |
| typedef breath_first_iter < GRAPH, ITERATOR, VISITED > | self |
Public Member Functions | |
| bool | visited (GRAPH::node *v) |
| void | set_visited (GRAPH::node *v) |
| self & | operator++ () |
| self | operator++ (int) |
| void | set_cur (GRAPH::node *v) |
| bool | empty () |
| GRAPH::node * | operator* () |
| breath_first_iter () | |
| breath_first_iter (GRAPH::node *v) | |
Public Attributes | |
| deque< ITERATOR > | state |
| VISITED | visited_set |
Detailed Description
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
struct breath_first_iter< GRAPH, ITERATOR, VISITED >
Definition at line 520 of file graph.h.
Member Typedef Documentation
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| typedef breath_first_iter<GRAPH, ITERATOR, VISITED> breath_first_iter< GRAPH, ITERATOR, VISITED >::self |
Constructor & Destructor Documentation
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| breath_first_iter< GRAPH, ITERATOR, VISITED >::breath_first_iter | ( | ) | [inline] |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| breath_first_iter< GRAPH, ITERATOR, VISITED >::breath_first_iter | ( | GRAPH::node * | v | ) | [inline] |
Member Function Documentation
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| bool breath_first_iter< GRAPH, ITERATOR, VISITED >::empty | ( | ) | [inline] |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| GRAPH::node* breath_first_iter< GRAPH, ITERATOR, VISITED >::operator* | ( | ) | [inline] |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| self breath_first_iter< GRAPH, ITERATOR, VISITED >::operator++ | ( | int | ) | [inline] |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| self& breath_first_iter< GRAPH, ITERATOR, VISITED >::operator++ | ( | ) | [inline] |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| void breath_first_iter< GRAPH, ITERATOR, VISITED >::set_cur | ( | GRAPH::node * | v | ) | [inline] |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| void breath_first_iter< GRAPH, ITERATOR, VISITED >::set_visited | ( | GRAPH::node * | v | ) | [inline] |
Definition at line 526 of file graph.h.
Referenced by breath_first_iter< TREE, ITERATOR, never_visited< TREE > >::operator++(), and breath_first_iter< TREE, ITERATOR, never_visited< TREE > >::set_cur().
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| bool breath_first_iter< GRAPH, ITERATOR, VISITED >::visited | ( | GRAPH::node * | v | ) | [inline] |
Definition at line 525 of file graph.h.
Referenced by breath_first_iter< TREE, ITERATOR, never_visited< TREE > >::operator++().
Member Data Documentation
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| deque<ITERATOR> breath_first_iter< GRAPH, ITERATOR, VISITED >::state |
template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
| VISITED breath_first_iter< GRAPH, ITERATOR, VISITED >::visited_set |
Definition at line 523 of file graph.h.
Referenced by breath_first_iter< TREE, ITERATOR, never_visited< TREE > >::set_visited(), and breath_first_iter< TREE, ITERATOR, never_visited< TREE > >::visited().
The documentation for this struct was generated from the following file:
- osprey1.0/common/util/graph.h
