is_split: Given a graph and a node, determine if the node is a split...

View source: R/UpdateKlass-graph-navigate.R

is_splitR Documentation

Given a graph and a node, determine if the node is a split code.

Description

Given a graph and a node, determine if the node is a split code.

Usage

is_split(graph, node)

Arguments

graph

A graph generated by klass_graph.

node

A node as returned by klass_node or V.

Details

The function will attempt to reconcile nodes that have split and then later merged again. A node is considered to be split if there is more than one node that does not itself have children (i.e. nodes at the end of a sequence of changes) that can be reached from node

Value

TRUE if the node is split, otherwise FALSE.


klassR documentation built on April 4, 2025, 4:16 a.m.

Related to is_split in klassR...