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

#include <DijkstraRouterEffort.h>

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

Public Member Functions

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

Detailed Description

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

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

Definition at line 107 of file DijkstraRouterEffort.h.

Member Function Documentation

◆ operator()()

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

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