These functions implement logical tests for various network properties. All is_*() functions return a logical scalar (TRUE or FALSE).

  • is_twomode() marks networks TRUE if they contain two sets of nodes.

  • is_weighted() marks networks TRUE if they contain tie weights.

  • is_directed() marks networks TRUE if the ties specify which node is the sender and which the receiver.

  • is_labelled() marks networks TRUE if there is a 'names' attribute for the nodes.

  • is_attributed() marks networks TRUE if there are other nodal attributes than 'names' or 'type'.

  • is_signed() marks networks TRUE if the ties can be either positive or negative.

  • is_complex() marks networks TRUE if any ties are loops, with the sender and receiver being the same node.

  • is_multiplex() marks networks TRUE if it contains multiple types of ties, such that there can be multiple ties between the same sender and receiver.

  • is_uniplex() marks networks TRUE if it is neither complex nor multiplex.

is_twomode(.data)

is_weighted(.data)

is_directed(.data)

is_labelled(.data)

is_signed(.data)

is_complex(.data)

is_multiplex(.data)

is_uniplex(.data)

is_attributed(.data)

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

See also

Other marking: mark_features, mark_is

Examples

is_twomode(create_filled(c(2,2)))
#> [1] TRUE
is_weighted(create_tree(3))
#> [1] FALSE
is_directed(create_tree(2))
#> [1] FALSE
is_directed(create_tree(2, directed = TRUE))
#> [1] TRUE
is_labelled(create_empty(3))
#> [1] FALSE
is_signed(create_lattice(3))
#> [1] FALSE
is_complex(create_lattice(4))
#> [1] FALSE
is_multiplex(create_filled(c(3,3)))
#> [1] FALSE
is_uniplex(create_star(3))
#> [1] TRUE
is_attributed(ison_algebra)
#> [1] FALSE