graph_algorithms: Algorithms for common graphical combinatorial problems

In rje42/MixedGraphs: Mixed Graphs and Graphical Models

Algorithms for common graphical combinatorial problems

Description

Algorithms for common graphical combinatorial problems

Usage

perfect_elim_order(graph, v)

peo(graph, v, po)

n_fill_in(graph, v, any = FALSE)

Arguments

graph	object of class mixedgraph
v	subset of vertices
po	optional partial ordering on elimination order
any	logical, if TRUE returns TRUE if any edge is added, FALSE otherwise

Details

Defaults to the entire graph if v is not supplied. This algorithm applies only to undirected edges.

Functions

• perfect_elim_order(): find a perfect elimination ordering (quadratic)

• peo(): find a perfect elimination ordering

• n_fill_in(): number of edges to add for given ordering

rje42/MixedGraphs documentation built on March 29, 2025, 11:47 p.m.