DijkstraRouter< E, V >::EdgeInfoByEffortComparator Class Reference

#include <DijkstraRouter.h>

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

Detailed Description

template<class E, class V>
class DijkstraRouter< E, V >::EdgeInfoByEffortComparator

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

Definition at line 69 of file DijkstraRouter.h.

Member Function Documentation

operator()()

template<class E , class V >

bool DijkstraRouter< E, V >::EdgeInfoByEffortComparator::operator() ( const typename SUMOAbstractRouter< E, V >::EdgeInfo *  nod1, const typename SUMOAbstractRouter< E, V >::EdgeInfo *  nod2  ) const

inline

Comparing method.

Definition at line 72 of file DijkstraRouter.h.

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

---

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

• DijkstraRouter.h