|
WSF
|
#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 |
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.
|
default |
|
overridedefault |
|
inlineoverride |
References wsf::comm::graph::Node::IsEnabled().
|
inlineoverride |
References wsf::comm::graph::Edge::GetWeight(), and wsf::comm::graph::Edge::IsEnabled().
|
inlineoverride |