Arrow: A directed edge in a digraph

In rdecision: Decision Analytic Modelling in Health Economics

A directed edge in a digraph

Description

An R6 class representing an directed edge in a digraph.

Details

An arrow is the formal term for an edge between pairs of nodes in a directed graph. Inherits from class Edge.

Super class

rdecision::Edge -> Arrow

Methods

Public methods

• Arrow$new()

• Arrow$source()

• Arrow$target()

• Arrow$clone()

Inherited methods

• rdecision::Edge$endpoints()
• rdecision::Edge$is_same_edge()
• rdecision::Edge$label()
• rdecision::Edge$modvars()

---

Method new()

Create an object of type Arrow.

Usage

Arrow$new(source_node, target_node, label = "")

Arguments

source_node

Node from which the arrow leaves.

target_node

Node to which the arrow points.

label

Character string containing the arrow label.

Returns

A new Arrow object.

---

Method source()

Access source node.

Usage

Arrow$source()

Returns

Node from which the arrow leads.

---

Method target()

Access target node.

Usage

Arrow$target()

Returns

Node to which the arrow points.

---

Method clone()

The objects of this class are cloneable with this method.

Usage

Arrow$clone(deep = FALSE)

Arguments

deep

Whether to make a deep clone.

Author(s)

Andrew J. Sims [e-mail]

rdecision documentation built on April 3, 2025, 6:09 p.m.