TraCIDijkstraRouter< E >::EdgeInfoByEffortComperator Class Reference

#include <TraCIDijkstraRouter.h>

---

Detailed Description

template<class E>
class TraCIDijkstraRouter< E >::EdgeInfoByEffortComperator

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

Definition at line 106 of file TraCIDijkstraRouter.h.

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

---

Constructor & Destructor Documentation

template<class E>

TraCIDijkstraRouter< E >::EdgeInfoByEffortComperator::EdgeInfoByEffortComperator

(

)

[inline, explicit]

Constructor.

Definition at line 109 of file TraCIDijkstraRouter.h.

{ }

template<class E>

TraCIDijkstraRouter< E >::EdgeInfoByEffortComperator::~EdgeInfoByEffortComperator

(

)

[inline]

Destructor.

Definition at line 112 of file TraCIDijkstraRouter.h.

{ }

---

Member Function Documentation

template<class E>

bool TraCIDijkstraRouter< E >::EdgeInfoByEffortComperator::operator()	(	EdgeInfo *	nod1,
		EdgeInfo *	nod2
	)			const [inline]

Comparing method.

Definition at line 115 of file TraCIDijkstraRouter.h.

References TraCIDijkstraRouter< E >::EdgeInfo::effort.

                                                              {
            return nod1->effort>nod2->effort;
        }

---

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

• TraCIDijkstraRouter.h