These functions implement logical tests for various network properties.
is_connected(.data)
is_perfect_matching(.data, mark = "type")
is_eulerian(.data)
is_acyclic(.data)
is_aperiodic(.data, max_path_length = 4)
https://stackoverflow.com/questions/55091438/r-igraph-find-all-cycles
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
A logical vector marking two types or modes. By default "type".
Maximum path length considered. If negative, paths of all lengths are considered. By default 4, to avoid potentially very long computation times.
TRUE if the condition is met, or FALSE otherwise.
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
Other marks:
mark_nodes
,
mark_ties
is_connected(ison_southern_women)
#> [1] TRUE
is_perfect_matching(ison_southern_women)
#> [1] FALSE
is_eulerian(ison_brandes)
#> [1] FALSE
is_acyclic(ison_algebra)
#> [1] FALSE
is_aperiodic(ison_algebra)
#> [1] TRUE