SUMO - Simulation of Urban MObility
DijkstraRouter< E, V, PF >::EdgeInfoByEffortComparator Class Reference

#include <DijkstraRouter.h>

Collaboration diagram for DijkstraRouter< E, V, PF >::EdgeInfoByEffortComparator:
Collaboration graph

Public Member Functions

bool operator() (const EdgeInfo *nod1, const EdgeInfo *nod2) const
 Comparing method. More...
 

Detailed Description

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

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

Definition at line 115 of file DijkstraRouter.h.

Member Function Documentation

◆ operator()()

template<class E, class V, class PF>
bool DijkstraRouter< E, V, PF >::EdgeInfoByEffortComparator::operator() ( const EdgeInfo nod1,
const EdgeInfo nod2 
) const
inline

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