Number of Non-Trivial Cycles

This function computes the number of non-trivial cycles in a breakpoint graph. Non-trivial cycles are cycles with more than 2 vertices, whereas trivial cycles are cycles with 2 vertices that represent common adjacencies.

Usage

cycle_nontrivial_count(g)

Arguments

g

The breakpoint graph.

Value

The number of cycles in a breakpoint graph.

See also

Other Breakpoint graph functions: bp_count(), breakpointGraphProperties(), breakpoint_graph(), components_graph(), cycle_count(), extendedPermutation(), hurdles_count(), is_fortress(), is_interleaving(), superhurdles_count()

Author

Bruna Fistarol

Examples

permutationVector(exampleInversion) |>
  GenomicBreaks:::extendedPermutation() |>
  GenomicBreaks:::breakpoint_graph() |>
  GenomicBreaks:::cycle_nontrivial_count()
#> [1] 1