make_full_citation_graph
creates a full citation graph. This is a
directed graph, where every i->j
edge is present if and only if
directed=FALSE
then the graph is just a full graph.
make_full_citation_graph(n, directed = TRUE)full_citation_graph(...)
The number of vertices.
Whether to create a directed graph.
Passed to make_full_citation_graph
.
An igraph graph.
Other determimistic constructors:
graph_from_atlas()
,
graph_from_edgelist()
,
graph_from_literal()
,
make_chordal_ring()
,
make_empty_graph()
,
make_full_graph()
,
make_graph()
,
make_lattice()
,
make_ring()
,
make_star()
,
make_tree()
# NOT RUN {
print_all(make_full_citation_graph(10))
# }
Run the code above in your browser using DataLab