Tulip
5.3.0
Large graphs analysis and drawing
|
#include <SortIterator.h>
Public Member Functions | |
SortTargetEdgeIterator (Iterator< tlp::edge > *itIn, const Graph *sg, const tlp::NumericProperty *metric, bool ascendingOrder=true) | |
Public Member Functions inherited from tlp::StableIterator< tlp::edge > | |
StableIterator (Iterator< tlp::edge > *inputIterator, size_t nbElements=0, bool deleteIterator=true, bool sortCopy=false) | |
bool | hasNext () |
tlp::edge | next () |
void | restart () |
Public Member Functions inherited from tlp::Iterator< tlp::edge > | |
iterator_t | begin () |
iterator_t | end () |
Additional Inherited Members | |
Protected Attributes inherited from tlp::StableIterator< tlp::edge > | |
std::vector< tlp::edge >::const_iterator | copyIterator |
std::vector< tlp::edge > | sequenceCopy |
This Iterator sorts the edges based on the values of their target nodes in a NumericProperty.
Definition at line 136 of file SortIterator.h.