is: Marking networks based on their properties

In migraph: Multimodal Network Analysis and More

Marking networks based on their properties

Description

These functions implement logical tests for various network properties.

Usage

is_connected(.data)

is_perfect_matching(.data, mark = "type")

is_eulerian(.data)

is_acyclic(.data)

is_aperiodic(.data, max_path_length = 4)

Arguments

.data	An object of a {manynet}-consistent class: matrix (adjacency or incidence) from {base} R edgelist, a data frame from {base} R or tibble from {tibble} igraph, from the {igraph} package network, from the {network} package tbl_graph, from the {tidygraph} package
mark	A logical vector marking two types or modes. By default "type".
max_path_length	Maximum path length considered. If negative, paths of all lengths are considered. By default 4, to avoid potentially very long computation times.

Value

TRUE if the condition is met, or FALSE otherwise.

Functions

• is_connected(): Tests whether network is weakly connected if the network is undirected or strongly connected if directed. To test weak connection on a directed network, please see manynet::to_undirected().

• is_perfect_matching(): Tests whether there is a matching for a network that covers every node in the network

• is_eulerian(): Tests whether there is a Eulerian path for a network where that path passes through every tie exactly once @importFrom igraph has_eulerian_path

• is_acyclic(): Tests whether network is a directed acyclic graph

• is_aperiodic(): Tests whether network is aperiodic

Source

https://stackoverflow.com/questions/55091438/r-igraph-find-all-cycles

See Also

Other marks: mark_nodes, mark_ties

Examples

is_connected(ison_southern_women)
is_perfect_matching(ison_southern_women)
is_eulerian(ison_brandes)
is_acyclic(ison_algebra)
is_aperiodic(ison_algebra)

migraph documentation built on Nov. 2, 2023, 5:47 p.m.