Is this a complete graph?

Description

A graph is considered complete if there is an edge between all distinct directed pairs of vertices. igraph considers both the singleton graph and the null graph complete.

Usage

is_complete(graph)

Arguments

Value

True if the graph is complete.

Related documentation in the C library

is_complete().

See Also

make_full_graph()

Other cliques: cliques(), ivs(), weighted_cliques()

Examples

g <- make_full_graph(6, directed = TRUE)
is_complete(g)
g <- delete_edges(g, 1)
is_complete(g)
g <- as_undirected(g)
is_complete(g)