graph_iterator.h File Reference

Include dependency graph for graph_iterator.h:

Classes
struct	stapl::sequential::_hei< Reference >
	Helper to infer the return property (const or non const) depending on the constness of the edge iterator. More...
struct	stapl::sequential::_hei< Value & >
	Helper to infer the return property (non const) if edge iterator is non const. More...
struct	stapl::sequential::_hei< Value const & >
	Helper to infer the return property (const) if edge iterator is const. More...
struct	stapl::sequential::_hei_it< Reference >
	Helper to infer the return property (const or non const) depending on the constness of the edge iterator. More...
struct	stapl::sequential::_hei_it< Value & >
	Helper to infer the return property (non const) if edge iterator is non const. More...
struct	stapl::sequential::_hei_it< Value const & >
	Helper to infer the return property (const) if edge iterator is const. More...
class	stapl::sequential::ve_view< C, Iter >
	Wrapper to provide an edge view for the adjacents of a vertex. More...
class	stapl::sequential::vertex_reference< BaseIterator >
	Class to provide a reference to a vertex object.Provides the interface of a graph vertex. This is the type returned when a vertex iterator is dereferenced. More...
class	stapl::sequential::vertex_pointer< Reference >
	Class to provide a pointer to a vertex object. More...
class	stapl::sequential::vertex_iterator_adaptor< BaseIterator >
	Class to provide an adaptor for the vertex iterator. More...
class	stapl::sequential::const_vertex_iterator_adaptor< BaseIterator >
	Class to provide a const adaptor for the vertex iterator. More...
struct	stapl::sequential::select_vertex_iterator< Iterator, Property >
	Selector class for vertex iterator.Other graphs may specialize the iterator type, and in order to do that they have to specialize based on the particular property type. More...
struct	stapl::sequential::select_const_vertex_iterator< Iterator, Property >
	Selector class for const vertex iterator.Other graphs may specialize the iterator type, and in order to do that they have to specialize based on the particular property type. More...
class	stapl::sequential::edge_reference< BaseIterator >
	Class to provide a reference to an edge object.Provides the interface of a graph edge. This is the type returned when a adj/edge iterator is dereferenced. More...
class	stapl::sequential::adj_edge_iterator_adaptor< BaseIterator >
	Class to provide an adaptor for the adjacent edge iterator. More...
struct	stapl::sequential::select_adj_edge_iterator< Iterator, Edge >
	Selector class for adjacent edge iterator. More...
struct	stapl::sequential::select_const_adj_edge_iterator< Iterator, Edge >
	Selector class for const adjacent edge iterator. More...
class	stapl::sequential::edge_iterator_adaptor< VertexIterator >
	Class to provide an adaptor for the edge iterator.An edge iterator allows traversal of all (out)edges in the graph. It does this by iterating over all adjacent edges of one vertex, moves to the next vertex and so on. There is no guaranteed order of edge traversal. In undirected graphs only one edge of a pair of sibling edges will be traversed. More...

Namespaces
	stapl

Functions
template<class Property >
void	stapl::sequential::test_if_property_available (typename boost::disable_if< boost::is_same< Property, properties::no_property > >::type *=0)
	Helper to check if the vertex/edge has a property.

Detailed Description

This file contains the iterator implementations for vertex iterator, adj_edge_iterator and edge_iterator. While these can be classes by themselves we implement them as boost iterator adaptors