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
\(j<i\). If directed=FALSE then the graph is just a full graph.
See also
Other deterministic constructors:
graph_from_atlas(),
graph_from_edgelist(),
graph_from_literal(),
make_(),
make_chordal_ring(),
make_circulant(),
make_empty_graph(),
make_full_graph(),
make_full_multipartite(),
make_graph(),
make_lattice(),
make_ring(),
make_star(),
make_tree(),
make_turan(),
make_wheel()
Examples
print_all(make_full_citation_graph(10))
#> ── <igraph> Full citation graph ───────────────────────────────────── b8e71c7 ──
#> ℹ directed
#> ℹ 10 vertices · 45 edges
#>
#> ── Attributes ──────────────────────────────────────────────────────────────────
#> → graph: name <chr>
#>
#> ── Graph attributes ────────────────────────────────────────────────────────────
#> name:
#> [1] "Full citation graph"
#>
#> ── Edges ───────────────────────────────────────────────────────────────────────
#> [1] 2 → 1 3 → 1 3 → 2 4 → 1 4 → 2 4 → 3 5 → 1 5 → 2 5 → 3
#> [10] 5 → 4 6 → 1 6 → 2 6 → 3 6 → 4 6 → 5 7 → 1 7 → 2 7 → 3
#> [19] 7 → 4 7 → 5 7 → 6 8 → 1 8 → 2 8 → 3 8 → 4 8 → 5 8 → 6
#> [28] 8 → 7 9 → 1 9 → 2 9 → 3 9 → 4 9 → 5 9 → 6 9 → 7 9 → 8
#> [37] 10 → 1 10 → 2 10 → 3 10 → 4 10 → 5 10 → 6 10 → 7 10 → 8 10 → 9