family: Familial Mixed Graph Relations

In rje42/MixedGraphs: Mixed Graphs and Graphical Models

Familial Mixed Graph Relations

Description

The usual familial relations between vertices in mixed graphs.

Usage

pa(graph, v, sort = 1)

ch(graph, v, sort = 1)

sp(graph, v, sort = 1)

sib(graph, v, sort = 1)

nb(graph, v, sort = 1)

anc(graph, v, sort = 1)

dec(graph, v, sort = 1)

ant(graph, v, sort = 1)

nhd(graph, v, sort = 1)

dis(graph, v, sort = 1, fast = FALSE)

Arguments

graph	mixedgraph object
v	collection of vertices
sort	integer:1 for unique but unsorted, 2 for sorted (0 for possibly repeated and unsorted). If edges are stored as a matrix then output will always be unique and sorted.
fast	optionally opt for a faster metod with adjacency matrices or lists

Details

pa, ch, sp and nb find the parents, children, spouses and neighbours of v respectively. anc, dec, ant, dis, nhd finds the ancestors descendants, anterior, district and neighbourhood of v respectively.

Functions

• pa(): find parents of vertices

• ch(): find children of vertices

• sp(): find spouses (siblings) of vertices

• sib(): find siblings (spouses) of vertices

• nb(): find undirected neighbours of vertices

• anc(): find ancestors of vertices

• dec(): find descendants of vertices

• ant(): find anterior vertices

• nhd(): find neighbourhood of vertices

• dis(): find district of vertices

rje42/MixedGraphs documentation built on March 20, 2024, 8:09 a.m.