districts: Familial Mixed Graph Groups

In rje42/MixedGraphs: Mixed Graphs and Graphical Models

Familial Mixed Graph Groups

Description

The usual familial relations between vertices in mixed graphs.

Usage

districts(graph, ...)

un(graph, sort = 1)

neighbourhoods(graph, undirected_only = TRUE)

cliques(graph, sort = 1, max_len)

Arguments

graph	mixedgraph object
...	other arguments, not currently used
sort	should output be sorted? sort=3 will also sort cliques
undirected_only	logical: should vertices not adjacent to an undirected edge be ignored?
max_len	maximum size of clique to consider

Details

districts and neighbourhoods find the bidirected-connected and undirected-connected components of graph. un finds the undirected part of graph.

cliques uses the Bron-Kirbosch algorithm to find maximal fully-connected subsets.

Functions

• un(): Obtain undirected component

• neighbourhoods(): Obtain neighbourhoods

• cliques(): Obtain maximal complete undirected subsets

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