make_full_citation_graph

graph.full.citation

full_citation_graph

<code>make_full_citation_graph</code> creates a full citation graph. This is a
directed graph, where every <code>i-&gt;j</code> edge is present if and only if
\(j&lt;i\). If <code>directed=FALSE</code> then the graph is just a full graph.

Routines for simple graphs and network analysis. It can
handle large graphs very well and provides functions for generating random
and regular graphs, graph visualization, centrality methods and much more.

Tam<c3><a1>s Nepusz

igraph

Network Analysis and Visualization

make_full_citation_graph function

<dl><dt>n</dt>
<dd>The number of vertices.</dd>
<dt>directed</dt>
<dd>Whether to create a directed graph.</dd>
<dt>...</dt>
<dd>Passed to <code>make_full_citation_graph</code>.</dd></dl>

Arguments

Create a complete (full) citation graph — make_full_citation_graph

<dl>

<dt>n</dt>
<dd>The number of vertices.</dd>


<dt>directed</dt>
<dd>Whether to create a directed graph.</dd>


<dt>...</dt>
<dd>Passed to <code>make_full_citation_graph</code>.</dd>

</dl>

make_full_citation_graph: Create a complete (full) citation graph

Description

Usage

Value

Arguments

See Also

Examples