pgrouting::compPathsLess Class Reference

#include "compPaths.h"

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

Detailed Description

Compares 2 paths for <

Returns

true when p1 < p2

Testing takes place in the following order:

• The aggregate cost is compared
• The length is compared
• The Node id is compared

Definition at line 47 of file compPaths.h.

Member Function Documentation

operator()()

bool pgrouting::compPathsLess::operator()	(	const Path &	p1,
		const Path &	p2
	)		const

Definition at line 40 of file compPaths.cpp.

                                                                   {
    /*
     * less cost is best
     */
    if (!(std::fabs(p2.tot_cost() - p1.tot_cost())
                <
                std::numeric_limits<double>::epsilon())) {
    if (p1.tot_cost() > p2.tot_cost())
        return  false;
    if (p1.tot_cost() < p2.tot_cost())
        return  true;
    }
 
    // paths costs are equal now check by length
    if (p1.size() > p2.size())
        return false;
    if (p1.size() < p2.size())
        return true;
 
//    pgassert(p1.tot_cost() == p2.tot_cost());
    pgassert(p1.size() == p2.size());
 
    // paths weights & lengths are equal now check by node ID
    unsigned int i;
    for (i = 0; i < p1.size(); i++) {
        if (p1[i].node >  p2[i].node)
            return false;
        if (p1[i].node <  p2[i].node)
            return true;
    }
 
//    pgassert(p1.tot_cost() == p2.tot_cost());
    pgassert(p1.size() == p2.size());
#ifdef NDEBUG
    for (i = 0; i < p1.size(); i++) {
        pgassert(p1[i].node == p2[i].node);
    }
#endif
 
    // we got here and everything is equal
    return false;
}

References pgassert, Path::size(), and Path::tot_cost().

---

The documentation for this class was generated from the following files:

• compPaths.h
• compPaths.cpp