MyOneVersusNoneHeavisideGainAlgo Class Reference

This algorithm is subclass of MyOneVersusNoneGainAlgo. This algorithm computes node states that are either HYPOTHETICAL_STATE or ANNOTATED_STATE. It computes the weighted average of the states of the neighbours of a node, subtracts a (user-defined) threshold and applies the Heaviside function to the result. The Heaviside function is 0 for negative arguments and 1 for positive arguments. More...

#include <gain-algorithm.h>

---

Detailed Description

This algorithm is subclass of MyOneVersusNoneGainAlgo. This algorithm computes node states that are either HYPOTHETICAL_STATE or ANNOTATED_STATE. It computes the weighted average of the states of the neighbours of a node, subtracts a (user-defined) threshold and applies the Heaviside function to the result. The Heaviside function is 0 for negative arguments and 1 for positive arguments.

Note:

MyOneVersusNoneHeavisideGainAlgo::run() does not need a threshold to be input. It efficiently computes the node states for all possible values of the threshold.

---

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

• /home/poirel/src/c++/biorithm/gain/gain-algorithm.h