DGtal::TangencyComputer< TKSpace >::ShortestPaths::Comparator Struct Reference

#include <DGtal/geometry/volumes/TangencyComputer.h>

Public Member Functions
bool	operator() (const Node &p1, const Node &p2) const

Detailed Description

template<typename TKSpace>
struct DGtal::TangencyComputer< TKSpace >::ShortestPaths::Comparator

Allows to compare two nodes (closest is popped first) by modeling a greater than relation (which is the relation used for std::priority_queue when you wish to have the smallest one outputed first).

Definition at line 103 of file TangencyComputer.h.

Member Function Documentation

operator()()

template<typename TKSpace >

bool DGtal::TangencyComputer< TKSpace >::ShortestPaths::Comparator::operator() ( const Node &  p1, const Node &  p2  ) const

inline

Parameters

p1	the first node
p2	the second node

Returns

'true' iff node p1 is further away than node p2.

Definition at line 107 of file TangencyComputer.h.

        {
          return std::get<2>( p1 ) > std::get<2>( p2 );
        }

---

The documentation for this struct was generated from the following file:

• TangencyComputer.h