graph.adjlist | R Documentation |
graph.adjlist()
was renamed to graph_from_adj_list()
to create a more
consistent API.
graph.adjlist(adjlist, mode = c("out", "in", "all", "total"), duplicate = TRUE)
adjlist |
The adjacency list. It should be consistent, i.e. the maximum throughout all vectors in the list must be less than the number of vectors (=the number of vertices in the graph). |
mode |
Character scalar, it specifies whether the graph to create is undirected (‘all’ or ‘total’) or directed; and in the latter case, whether it contains the outgoing (‘out’) or the incoming (‘in’) neighbors of the vertices. |
duplicate |
Logical scalar. For undirected graphs it gives whether
edges are included in the list twice. E.g. if it is This argument is ignored if |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.