graph_loops_stats: counts number of loops of length 3, 4, ..., max.loop.length.

In khabbazian/looplets: Decomposing a graph into loops

Description

Counts number of loops of length 3, 4, ..., max.loop.length. The results are inclusive. That is if an edge belongs to a loop of size k it is not consider for loop of size k+1.

Usage

graph_loops_stats(edge.list, max.loop.length = 10)

Arguments

edge.list	an edge list of an undirected graph. If the graph is directed, i.e. v->u exits but u->v doesn't then it may return the wrong result without warning
max.loop.length	an upper bound for the loop lengths

Value

the statistics of the loops including number of loops and number of edges in the counted loops. If edge e is a part of for instance two loops it is counted once.

Examples

er.edgelist <- ER_graph(3, 100)
g.stat <- graph_loops_stats(er.edgelist)

khabbazian/looplets documentation built on May 20, 2019, 9:22 a.m.