OpenFPM_data  0.1.0
Project that contain the implementation and interfaces for basic structure like vectors, grids, graph ... .
 All Data Structures Namespaces Functions Variables Typedefs Friends
Public Member Functions | Private Attributes
edge_iterator< Graph > Class Template Reference

Graph edge iterator. More...

Detailed Description

template<typename Graph>
class edge_iterator< Graph >

Graph edge iterator.

Definition at line 149 of file map_graph.hpp.

#include <map_graph.hpp>

Public Member Functions

 edge_iterator (const Graph &g)
 Constructor. More...
 
edge_iterator & operator++ ()
 Get the next element. More...
 
bool isNext ()
 Check if there is the next element. More...
 
edge_key get ()
 Get the actual key. More...
 
size_t source ()
 Return the source node. More...
 
size_t target ()
 Return the target node. More...
 

Private Attributes

const Graph & g
 Graph.
 
edge_key ek
 

Constructor & Destructor Documentation

template<typename Graph>
edge_iterator< Graph >::edge_iterator ( const Graph &  g)
inline

Constructor.

Parameters
gGraph on where iterate

Definition at line 165 of file map_graph.hpp.

Member Function Documentation

template<typename Graph>
edge_key edge_iterator< Graph >::get ( )
inline

Get the actual key.

Get the actual key

Returns
the actual key

Definition at line 229 of file map_graph.hpp.

template<typename Graph>
bool edge_iterator< Graph >::isNext ( )
inline

Check if there is the next element.

Check if there is the next element

Returns
true if there is the next, false otherwise

we did not reach the end of the node

we reach the end of the node

Definition at line 209 of file map_graph.hpp.

template<typename Graph>
edge_iterator& edge_iterator< Graph >::operator++ ( )
inline

Get the next element.

Returns
the next grid_key

Definition at line 177 of file map_graph.hpp.

template<typename Graph>
size_t edge_iterator< Graph >::source ( )
inline

Return the source node.

Returns
the source node

Definition at line 239 of file map_graph.hpp.

template<typename Graph>
size_t edge_iterator< Graph >::target ( )
inline

Return the target node.

Returns
the target node

Definition at line 249 of file map_graph.hpp.

The documentation for this class was generated from the following file: