WSF
wsf::comm::EdgeWeight Class Reference

#include <WsfCommRoutingAlgorithmLibrary.hpp>

Inherits graph::GraphImpl::cost_func.

Public Member Functions

 EdgeWeight ()=default
 ~EdgeWeight () override=default
double operator() (const graph::Edge &aEdge, const graph::Node &aSourceNode, const graph::Node &aDestinationNode) const override
double operator() (const graph::Node &aSourceNode, const graph::Node &aDestinationNode) const override
bool consider_node (const graph::Node &aNode) const override

Detailed Description

This algorithm uses the user defined edge costs to determine the shortest path. It is assumed these values are set in the graph prior to usage, otherwise they are defaulted to a value of 1.

Constructor & Destructor Documentation

◆ EdgeWeight()

wsf::comm::EdgeWeight::EdgeWeight ( )
default

◆ ~EdgeWeight()

wsf::comm::EdgeWeight::~EdgeWeight ( )
overridedefault

Member Function Documentation

◆ consider_node()

bool wsf::comm::EdgeWeight::consider_node ( const graph::Node & aNode) const
inlineoverride

◆ operator()() [1/2]

double wsf::comm::EdgeWeight::operator() ( const graph::Edge & aEdge,
const graph::Node & aSourceNode,
const graph::Node & aDestinationNode ) const
inlineoverride

◆ operator()() [2/2]

double wsf::comm::EdgeWeight::operator() ( const graph::Node & aSourceNode,
const graph::Node & aDestinationNode ) const
inlineoverride

The documentation for this class was generated from the following file:
Copyrights Multiple, All Rights Reserved