Skip to contents

The Edge Pruner Algorithm (EPA). This algorithm handles the redundancy of the constraints matrix (see create_ThetaMatrix()) by deleting all unecessary edges. The result is

Source: R/GraphNetwork.R
remove_transitive_edges.Rd

The Edge Pruner Algorithm (EPA). This algorithm handles the redundancy of the constraints matrix (see create_ThetaMatrix()) by deleting all unecessary edges. The result is

Usage

remove_transitive_edges(Sc, n_samples = NaN)

Arguments

Sc

matrix or character : The stratigraphic relation between samples.

n_samples

numeric NaN by default. Optional size of samples to create a strict order DAG without constructing Sc

Value

igraph a non transitive DAG that can also be referred to as a Hasse Diagram.

Author

Imène Bouafia

Examples

#Example for strict order
network <- remove_transitive_edges(c(), n_samples = 5)
print(network)
#> IGRAPH 382320c D--- 5 4 -- 
#> + edges from 382320c:
#> [1] 1->2 2->3 3->4 4->5