is_complete | R Documentation |
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.
is_complete(graph)
graph |
The input graph. |
True if the graph is complete.
make_full_graph()
Other cliques:
cliques()
,
ivs()
,
weighted_cliques()
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)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.