Overview     Modules     Class Hierarchy     Classes     Members  
tlp::SortTargetEdgeIterator Struct Reference

This Iterator sorts the edges based on the values of their target nodes in a DoubleProperty. More...

#include <SortIterator.h>

Inheritance diagram for tlp::SortTargetEdgeIterator:
Collaboration diagram for tlp::SortTargetEdgeIterator:

Public Member Functions

 SortTargetEdgeIterator (Iterator< edge > *itIn, Graph *sg, DoubleProperty *metric)
 ~SortTargetEdgeIterator ()
- Public Member Functions inherited from tlp::StableIterator< edge >
 StableIterator (Iterator< edge > *inputIterator, size_t nbElements=0, bool deleteIterator=true)
 Creates a stable Iterator, that allows to delete elements from a graph while iterating on them.
 ~StableIterator ()
edge next ()
 Moves the Iterator on the next element.
bool hasNext ()
 Tells if the sequence is at its end.
void restart ()
 Restarts the iteration by moving the Iterator to the beginning of the sequence.
- Public Member Functions inherited from tlp::Iterator< edge >
 Iterator ()
virtual ~Iterator ()

Additional Inherited Members

- Protected Attributes inherited from tlp::StableIterator< edge >
std::vector< edgesequenceCopy
 A copy of the sequence of elements to iterate on.
std::vector< edge >::const_iterator copyIterator
 STL const_iterator on the cloned sequence.

Detailed Description

This Iterator sorts the edges based on the values of their target nodes in a DoubleProperty.

Constructor & Destructor Documentation

tlp::SortTargetEdgeIterator::SortTargetEdgeIterator ( Iterator< edge > *  itIn,
Graph sg,
DoubleProperty metric 
)
inline
tlp::SortTargetEdgeIterator::~SortTargetEdgeIterator ( )
inline


Tulip Software by LaBRI Visualization Team    2001 - 2012