![]() |
Tulip
5.7.0
Large graphs analysis and drawing
|
#include <SortIterator.h>
Public Member Functions | |
SortNodeIterator (Iterator< tlp::node > *itIn, const tlp::NumericProperty *metric, bool ascendingOrder=true) | |
![]() | |
StableIterator (Iterator< tlp::node > *inputIterator, size_t nbElements=0, bool deleteIterator=true, bool sortCopy=false) | |
bool | hasNext () |
tlp::node | next () |
void | restart () |
![]() | |
iterator_t | begin () |
iterator_t | end () |
Additional Inherited Members | |
![]() | |
std::vector< tlp::node >::const_iterator | copyIterator |
std::vector< tlp::node > | sequenceCopy |
This Iterator sorts the nodes in a sequence based on their values in a NumericProperty.
Definition at line 93 of file SortIterator.h.