AFRouter< E, N, V >::EdgeInfoComparator Class Reference

#include <AFRouter.h>

Public Member Functions
bool	operator() (const typename SUMOAbstractRouter< E, V >::EdgeInfo *edgeInfo1, const typename SUMOAbstractRouter< E, V >::EdgeInfo *edgeInfo2) const
	Comparing method.

Detailed Description

template<class E, class N, class V>
class AFRouter< E, N, V >::EdgeInfoComparator

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

Definition at line 121 of file AFRouter.h.

Member Function Documentation

operator()()

template<class E , class N , class V >

bool AFRouter< E, N, V >::EdgeInfoComparator::operator() ( const typename SUMOAbstractRouter< E, V >::EdgeInfo *  edgeInfo1, const typename SUMOAbstractRouter< E, V >::EdgeInfo *  edgeInfo2  ) const

inline

Comparing method.

Parameters

[in]	edgeInfo1	First edge information
[in]	edgeInfo2	Second edge information

Returns

true iff heuristic effort of first edge information is greater than that of the second

Note

In case of ties: true iff first edge information's numerical id is greater than that of the second

Definition at line 130 of file AFRouter.h.

References SUMOAbstractRouter< E, V >::EdgeInfo::edge, and SUMOAbstractRouter< E, V >::EdgeInfo::heuristicEffort.

---

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

• AFRouter.h