getTrekSystem: Determines if a trek system exists in the mixed graph.

In SEMID: Identifiability of Linear Structural Equation Models

Determines if a trek system exists in the mixed graph.

Description

Determines if a trek system exists in the mixed graph.

Usage

getTrekSystem(
  this,
  fromNodes,
  toNodes,
  avoidLeftNodes = integer(0),
  avoidRightNodes = integer(0),
  avoidLeftEdges = integer(0),
  avoidRightEdges = integer(0),
  ...
)

## S3 method for class 'LatentDigraphFixedOrder'
getTrekSystem(
  this,
  fromNodes,
  toNodes,
  avoidLeftNodes = integer(0),
  avoidRightNodes = integer(0),
  avoidLeftEdges = integer(0),
  avoidRightEdges = integer(0),
  ...
)

## S3 method for class 'LatentDigraph'
getTrekSystem(
  this,
  fromNodes,
  toNodes,
  avoidLeftNodes = integer(0),
  avoidRightNodes = integer(0),
  avoidLeftEdges = integer(0),
  avoidRightEdges = integer(0),
  ...
)

Arguments

this	the graph object
fromNodes	the start nodes
toNodes	the end nodes
avoidLeftNodes	a collection of nodes to avoid on the left
avoidRightNodes	a collection of nodes to avoid on the right
avoidLeftEdges	a collection of edges between observed nodes in the graph that should not be used on any right hand side of any trek in the trek system.
avoidRightEdges	a collection of edges between observed noes in the graph that should not be used on any right hand side of any trek in the trek system.
...	ignored

SEMID documentation built on July 26, 2023, 5:40 p.m.