scram::core::Variable
Boolean variables in a Boolean formula or graph. More...
#include <pdag.h>
Inherits from scram::core::Node, scram::core::NodeParentManager, boost::noncopyable
Public Functions
| Name | |
|---|---|
| Node(Pdag * graph)<br>Creates a unique graph node as a member of a PDAG. |
Additional inherited members
Public Functions inherited from scram::core::Node
| Name | |
|---|---|
| virtual | ~Node() =0<br>Abstract class. |
| Pdag & | graph() |
| int | index() const |
| int | order() const |
| void | order(int val)<br>Sets the order number for this node. |
| int | opti_value() const |
| void | opti_value(int val)<br>Sets the optimization value for failure propagation. |
| bool | Visit(int time)<br>Registers the visit time for this node upon graph traversal. |
| int | EnterTime() const |
| int | ExitTime() const |
| int | LastVisit() const |
| virtual int | min_time() const |
| virtual int | max_time() const |
| bool | Revisited() const |
| bool | Visited() const |
| void | ClearVisits()<br>Clears all the visit information. Resets the visit times to 0s. |
| int | pos_count() const |
| int | neg_count() const |
| void | AddCount(bool positive)<br>Increases the count of this node. |
| void | ResetCount()<br>Resets positive and negative counts of this node. |
Public Types inherited from scram::core::NodeParentManager
| Name | |
|---|---|
| using std::pair< int, GateWeakPtr > | Parent <br>Parent index and ptr. |
| using ext::linear_map< int, GateWeakPtr, ext::MoveEraser > | ParentMap <br>A map type of parent gate positive indices and weak pointers to them. |
Public Functions inherited from scram::core::NodeParentManager
| Name | |
|---|---|
| const ParentMap & | parents() const |
Protected Functions inherited from scram::core::NodeParentManager
| Name | |
|---|---|
| ~NodeParentManager() =default |
Friends inherited from scram::core::NodeParentManager
| Name | |
|---|---|
| class | Gate <br>The main manipulator of parent information. |
Detailed Description
cpp
class scram::core::Variable;Boolean variables in a Boolean formula or graph.
Variables can represent the basic events of fault trees.
Public Functions Documentation
function Node
cpp
explicit Node(
Pdag * graph
)Creates a unique graph node as a member of a PDAG.
Parameters:
- graph The graph this node belongs to.
Updated on 2025-11-11 at 16:51:08 +0000