DijkstraRouterEffortBase< E, V, PF >::EdgeInfoByEffortComparator Class Reference

#include <DijkstraRouterEffort.h>

---

Detailed Description

template<class E, class V, class PF>
class DijkstraRouterEffortBase< E, V, PF >::EdgeInfoByEffortComparator

Class to compare (and so sort) nodes by their effort

Definition at line 111 of file DijkstraRouterEffort.h.

Public Member Functions
bool	operator() (EdgeInfo *nod1, EdgeInfo *nod2) const
	Comparing method.

---

Member Function Documentation

template<class E, class V, class PF>

bool DijkstraRouterEffortBase< E, V, PF >::EdgeInfoByEffortComparator::operator()	(	EdgeInfo *	nod1,
		EdgeInfo *	nod2
	)			const [inline]

Comparing method.

Definition at line 114 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::edge, and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::effort.

                                                              {
            if (nod1->effort == nod2->effort) {
                return nod1->edge->getNumericalID() > nod2->edge->getNumericalID();
            }
            return nod1->effort>nod2->effort;
        }

---

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

• DijkstraRouterEffort.h