Tulip  5.7.4
Large graphs analysis and drawing
tlp::SortExtremitiesEdgeIterator Struct Reference

#include <SortIterator.h>

+ Inheritance diagram for tlp::SortExtremitiesEdgeIterator:
+ Collaboration diagram for tlp::SortExtremitiesEdgeIterator:

Public Member Functions

 SortExtremitiesEdgeIterator (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< 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::edgesequenceCopy

Detailed Description

This Iterator sorts the edges based on the values of their extremities nodes in a NumericProperty.

Definition at line 180 of file SortIterator.h.