_visitor_cc_edges(Graph &, CONTAINER &_v) (defined in stapl::sequential::_visitor_cc_edges< Graph, CONTAINER >) | stapl::sequential::_visitor_cc_edges< Graph, CONTAINER > | |
black_target(typename Graph::vertex_iterator, typename Graph::adj_edge_iterator ei) (defined in stapl::sequential::_visitor_cc_edges< Graph, CONTAINER >) | stapl::sequential::_visitor_cc_edges< Graph, CONTAINER > | |
visitor_base< Graph >::black_target(vertex_iterator, adj_edge_iterator) | stapl::visitor_base< Graph > | virtual |
discover_vertex(vertex_iterator) | stapl::visitor_base< Graph > | virtual |
examine_edge(vertex_iterator, adj_edge_iterator) | stapl::visitor_base< Graph > | virtual |
examine_vertex(vertex_iterator) | stapl::visitor_base< Graph > | virtual |
finish_vertex(vertex_iterator, int=-1) | stapl::visitor_base< Graph > | virtual |
gray_target(typename Graph::vertex_iterator, typename Graph::adj_edge_iterator ei) (defined in stapl::sequential::_visitor_cc_edges< Graph, CONTAINER >) | stapl::sequential::_visitor_cc_edges< Graph, CONTAINER > | |
visitor_base< Graph >::gray_target(vertex_iterator, adj_edge_iterator) | stapl::visitor_base< Graph > | virtual |
non_tree_edge(vertex_iterator, adj_edge_iterator) | stapl::visitor_base< Graph > | virtual |
tree_edge(typename Graph::vertex_iterator, typename Graph::adj_edge_iterator ei) (defined in stapl::sequential::_visitor_cc_edges< Graph, CONTAINER >) | stapl::sequential::_visitor_cc_edges< Graph, CONTAINER > | |
visitor_base< Graph >::tree_edge(vertex_iterator, adj_edge_iterator) | stapl::visitor_base< Graph > | virtual |
visitor_base() (defined in stapl::visitor_base< Graph >) | stapl::visitor_base< Graph > | |
visitor_base(Graph &) | stapl::visitor_base< Graph > | |
~visitor_base() | stapl::visitor_base< Graph > | virtual |