powered by
Create a full graph
make_full_graph(n, directed = FALSE, loops = FALSE)full_graph(...)
full_graph(...)
An igraph graph
Number of vertices.
Whether to create a directed graph.
Whether to add self-loops to the graph.
Passed to make_full_graph.
make_full_graph
Other deterministic constructors: graph_from_atlas(), graph_from_edgelist(), graph_from_literal(), make_chordal_ring(), make_empty_graph(), make_full_citation_graph(), make_graph(), make_lattice(), make_ring(), make_star(), make_tree()
graph_from_atlas()
graph_from_edgelist()
graph_from_literal()
make_chordal_ring()
make_empty_graph()
make_full_citation_graph()
make_graph()
make_lattice()
make_ring()
make_star()
make_tree()
make_full_graph(5) print_all(make_full_graph(4, directed = TRUE))
Run the code above in your browser using DataLab