![]()  | 
  
    Tulip
    6.0.0
    
   Large graphs analysis and drawing 
   | 
 
#include <SortIterator.h>
 Inheritance diagram for tlp::SortEdgeIterator:
 Collaboration diagram for tlp::SortEdgeIterator:Public Member Functions | |
| SortEdgeIterator (Iterator< tlp::edge > *itIn, 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< T > | |
| 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 in a sequence based on their values in a NumericProperty.
Definition at line 114 of file SortIterator.h.