Type Alias igraph_loops_t 

pub type igraph_loops_t = c_uint;

\typedef igraph_loops_t \brief How to interpret self-loops in undirected graphs?

Controls the interpretation of self-loops in undirected graphs, typically in the context of adjacency matrices or degrees.

These constants are also used to improve readability in boolean contexts, with \c IGRAPH_NO_LOOPS, equivalent to \c false, signifying that loops should be ignored and \c IGRAPH_LOOPS, equivalent to \c true, that loops should be considered.

\enumval IGRAPH_NO_LOOPS Self-loops are ignored. \enumval IGRAPH_LOOPS_TWICE Self-loops are considered, and counted twice in undirected graphs. For example, a self-loop contributes two to the degree of a vertex and to diagonal entries of adjacency matrices. This is the standard interpretation in graph theory, thus \c IGRAPH_LOOPS serves as an alias for this option. \enumval IGRAPH_LOOPS_ONCE Self-loops are considered, and counted only once in undirected graphs.