# igraph v1.2.6

0

Monthly downloads

## Network Analysis and Visualization

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.

## Functions in igraph

Name | Description | |

centralize | Centralization of a graph | |

c.igraph.es | Concatenate edge sequences | |

c.igraph.vs | Concatenate vertex sequences | |

as.igraph | Conversion to igraph | |

as.directed | Convert between directed and undirected graphs | |

bfs | Breadth-first search | |

biconnected_components | Biconnected components | |

cliques | The functions find cliques, ie. complete subgraphs in a graph | |

adjacent_vertices | Adjacent vertices of multiple vertices in a graph | |

arpack_defaults | ARPACK eigenvector calculation | |

all_simple_paths | List all simple paths from one source | |

articulation_points | Articulation points of a graph | |

centr_clo | Centralize a graph according to the closeness of vertices | |

cocitation | Cocitation coupling | |

igraph-package | The igraph package | |

component_distribution | Connected components of a graph | |

centr_clo_tmax | Theoretical maximum for closeness centralization | |

cluster_edge_betweenness | Community structure detection based on edge betweenness | |

closeness | Closeness centrality of vertices | |

assortativity | Assortativity coefficient | |

cohesive_blocks | Calculate Cohesive Blocks | |

compose | Compose two graphs as binary relations | |

authority_score | Kleinberg's authority centrality scores. | |

add_edges | Add edges to a graph | |

canonical_permutation | Canonical permutation of a graph | |

as_adjacency_matrix | Convert a graph to an adjacency matrix | |

as_adj_list | Adjacency lists | |

V | Vertices of a graph | |

E | Edges of a graph | |

categorical_pal | Palette for categories | |

bipartite_mapping | Decide whether a graph is bipartite | |

bipartite_projection | Project a bipartite graph | |

automorphisms | Number of automorphisms | |

as_edgelist | Convert a graph to an edge list | |

count_subgraph_isomorphisms | Count the isomorphic mappings between a graph and the subgraphs of another graph | |

difference.igraph.es | Difference of edge sequences | |

count_triangles | Find triangles in graphs | |

centr_betw | Centralize a graph according to the betweenness of vertices | |

estimate_betweenness | Vertex and edge betweenness centrality | |

cluster_infomap | Infomap community finding | |

cluster_fast_greedy | Community structure via greedy optimization of modularity | |

difference.igraph.vs | Difference of vertex sequences | |

cluster_louvain | Finding community structure by multi-level optimization of modularity | |

delete_edge_attr | Delete an edge attribute | |

degree | Degree and degree distribution of the vertices | |

as_graphnel | Convert igraph graphs to graphNEL objects from the graph package | |

cluster_optimal | Optimal community structure | |

dominator_tree | Dominator tree | |

diversity | Graph diversity | |

fit_power_law | Fitting a power-law distribution function to discrete data | |

get.edge.ids | Find the edge ids based on the incident vertices of the edges | |

graph_version | Igraph data structure versions | |

graphlet_basis | Graphlet decomposition of a graph | |

hrg-methods | Hierarchical random graphs | |

centr_betw_tmax | Theoretical maximum for betweenness centralization | |

centr_eigen_tmax | Theoretical maximum for betweenness centralization | |

centr_eigen | Centralize a graph according to the eigenvector centrality of vertices | |

as_long_data_frame | Convert a graph to a long data frame | |

consensus_tree | Create a consensus tree from several hierarchical random graph models | |

as_membership | Declare a numeric vector as a membership vector | |

console | The igraph console | |

edge | Helper function for adding and deleting edges | |

eccentricity | Eccentricity of the vertices in a graph | |

edge_density | Graph density | |

hrg | Create a hierarchical random graph from an igraph graph | |

centr_degree | Centralize a graph according to the degrees of vertices | |

component_wise | Component-wise layout | |

graph_from_atlas | Create a graph from the Graph Atlas | |

complementer | Complementer of a graph | |

cluster_walktrap | Community strucure via short random walks | |

cluster_spinglass | Finding communities in graphs based on statistical meachanics | |

centr_degree_tmax | Theoretical maximum for degree centralization | |

as_data_frame | Creating igraph graphs from data frames or vice-versa | |

ego_size | Neighborhood of graph vertices | |

cluster_label_prop | Finding communities based on propagating labels | |

count_isomorphisms | Count the number of isomorphic mappings between two graphs | |

cluster_leading_eigen | Community structure detecting based on the leading eigenvector of the community matrix | |

convex_hull | Convex hull of a set of vertices | |

delete_vertices | Delete vertices from a graph | |

count_motifs | Graph motifs | |

delete_vertex_attr | Delete a vertex attribute | |

delete_edges | Delete edges from a graph | |

delete_graph_attr | Delete a graph attribute | |

dfs | Depth-first search | |

diameter | Diameter of a graph | |

coreness | K-core decomposition of graphs | |

decompose | Decompose a graph into components | |

diverging_pal | Diverging palette | |

disjoint_union | Disjoint union of graphs | |

distance_table | Shortest (directed or undirected) paths between vertices | |

curve_multiple | Optimal edge curvature when plotting graphs | |

dim_select | Dimensionality selection for singular values using profile likelihood. | |

is_separator | Vertex separators | |

hub_score | Kleinberg's hub centrality scores. | |

hrg_tree | Create an igraph graph from a hierarchical random graph model | |

is_weighted | Weighted graphs | |

layout.svd | SVD layout, this was removed from igraph | |

edge_attr_names | List names of edge attributes | |

edge_connectivity | Edge connectivity. | |

igraph-es-attributes | Query or set attributes of the edges in an edge sequence | |

girth | Girth of a graph | |

igraph-dollar | Getting and setting graph attributes, shortcut | |

intersection.igraph | Intersection of graphs | |

gorder | Order (number of vertices) of a graph | |

graph_from_literal | Creating (small) graphs via a simple interface | |

constraint | Burt's constraint | |

membership | Functions to deal with the result of network community detection | |

contract | Contract several vertices into a single one | |

compare | Compares community structures using various metrics | |

intersection.igraph.es | Intersection of edge sequences | |

graph_id | Get the id of a graph | |

layout_ | Graph layouts | |

dyad_census | Dyad census of a graph | |

is_directed | Check whether a graph is directed | |

erdos.renyi.game | Generate random graphs according to the Erdos-Renyi model | |

difference | Difference of two sets | |

is_graphical | Is a degree sequence graphical? | |

difference.igraph | Difference of graphs | |

isomorphic | Decide if two graphs are isomorphic | |

fit_hrg | Fit a hierarchical random graph model | |

graph_from_adj_list | Create graphs from adjacency lists | |

graph_from_adjacency_matrix | Create graphs from adjacency matrices | |

graph_from_edgelist | Create a graph from an edge list matrix | |

graph_from_graphdb | Load a graph from the graph database for testing graph isomorphism. | |

identical_graphs | Decide if two graphs are identical | |

isomorphism_class | Isomorphism class of a graph | |

layout_as_tree | The Reingold-Tilford graph layout algorithm | |

indent_print | Indent a printout | |

layout_in_circle | Graph layout with vertices on a circle. | |

igraph_options | Parameters for the igraph package | |

igraph_demo | Run igraph demos, step by step | |

layout_with_graphopt | The graphopt layout algorithm | |

each_edge | Rewires the endpoints of the edges of a graph to a random vertex | |

layout_with_kk | The Kamada-Kawai layout algorithm | |

ends | Incident vertices of some graph edges | |

graph_attr<- | Set all or some graph attributes | |

graph_ | Convert object to a graph | |

graph_from_graphnel | Convert graphNEL objects from the graph package to igraph | |

intersection | Intersection of two or more sets | |

embed_laplacian_matrix | Spectral Embedding of the Laplacian of a Graph | |

layout_with_gem | The GEM layout algorithm | |

layout_with_fr | The Fruchterman-Reingold layout algorithm | |

make_de_bruijn_graph | De Bruijn graphs | |

make_chordal_ring | Create an extended chordal ring graph | |

make_empty_graph | A graph with no edges | |

igraph-attribute-combination | How igraph functions handle attributes when the graph changes | |

is_named | Named graphs | |

make_line_graph | Line graph of a graph | |

make_clusters | Creates a communities object. | |

make_ring | Create a ring graph | |

graph_from_incidence_matrix | Create graphs from an incidence matrix | |

match_vertices | Match Graphs given a seeding of vertex correspondences | |

is_printer_callback | Is this a printer callback? | |

igraph-minus | Delete vertices or edges from a graph | |

edge_attr | Query edge attributes of a graph | |

edge_attr<- | Set one or more edge attributes | |

eigen_centrality | Find Eigenvector Centrality Scores of Network Positions | |

min_separators | Minimum size vertex separators | |

igraph-vs-attributes | Query or set attributes of the vertices in a vertex sequence | |

is_matching | Graph matching | |

graph_attr | Graph attributes of a graph | |

min_st_separators | Minimum size vertex separators | |

embed_adjacency_matrix | Spectral Embedding of Adjacency Matrices | |

graph_attr_names | List names of graph attributes | |

graph_from_isomorphism_class | Create a graph from an isomorphism class | |

print.nexusDatasetInfo | Query and download from the Nexus network repository | |

norm_coords | Normalize coordinates for plotting graphs | |

groups | Groups of a vertex partitioning | |

gsize | The size of the graph (number of edges) | |

keeping_degseq | Graph rewiring while preserving the degree distribution | |

graph_from_lcf | Creating a graph from LCF notation | |

head_print | Print the only the head of an R object | |

head_of | Head of the edge(s) in a graph | |

incident | Incident edges of a vertex in a graph | |

knn | Average nearest neighbor degree | |

incident_edges | Incident edges of multiple vertices in a graph | |

%>% | Magrittr's pipes | |

print.igraph.es | Print an edge sequence to the screen | |

Drawing graphs | Drawing graphs | |

igraph-es-indexing | Indexing edge sequences | |

laplacian_matrix | Graph Laplacian | |

layout.reingold.tilford | Deprecated layout functions | |

print.igraph.vs | Show a vertex sequence on the screen | |

igraph-es-indexing2 | Select edges and show their metadata | |

igraph-vs-indexing | Indexing vertex sequences | |

igraph-vs-indexing2 | Select vertices and show their metadata | |

layout_on_sphere | Graph layout with vertices on the surface of a sphere | |

igraph_test | Run package tests | |

igraph_version | Query igraph's version string | |

layout_randomly | Randomly place vertices on a plane or in 3d space | |

layout_nicely | Choose an appropriate graph layout algorithm automatically | |

is_igraph | Is this object an igraph graph? | |

plot.igraph | Plotting of graphs | |

is_min_separator | Minumal vertex separators | |

isomorphisms | Calculate all isomorphic mappings between the vertices of two graphs | |

ivs | Independent vertex sets | |

layout_with_dh | The Davidson-Harel layout algorithm | |

intersection.igraph.vs | Intersection of vertex sequences | |

layout_as_star | Generate coordinates to place the vertices of a graph in a star-shape | |

layout_as_bipartite | Simple two-row layout for bipartite graphs | |

is_chordal | Chordality of a graph | |

layout_with_sugiyama | The Sugiyama graph layout generator | |

layout_with_drl | The DrL graph layout generator | |

is_dag | Directed acyclic graphs | |

rewire | Rewiring edges of a graph | |

rev.igraph.vs | Reverse the order in a vertex sequence | |

local_scan | Compute local scan statistics on graphs | |

make_ | Make a new graph | |

plot.sir | Plotting the results on multiple SIR model runs | |

sample_degseq | Generate random graphs with a given degree sequence | |

layout_on_grid | Simple grid layout | |

is_degseq | Check if a degree sequence is valid for a multi-graph | |

layout.fruchterman.reingold.grid | Grid Fruchterman-Reingold layout, this was removed from igraph | |

is_bipartite | Create a bipartite graph | |

make_full_citation_graph | Create a complete (full) citation graph | |

layout.spring | Spring layout, this was removed from igraph | |

make_full_bipartite_graph | Create a full bipartite graph | |

power_centrality | Find Bonacich Power Centrality Scores of Network Positions | |

+.igraph | Add vertices, edges or another graph to a graph | |

motifs | Graph motifs | |

modularity.igraph | Modularity of a community structure of a graph | |

make_lattice | Create a lattice graph | |

make_kautz_graph | Kautz graphs | |

max_flow | Maximum flow in a graph | |

sample_dirichlet | Sample from a Dirichlet distribution | |

max_cardinality | Maximum cardinality search | |

rep.igraph | Replicate a graph multiple times | |

sample_grg | Geometric random graphs | |

mst | Minimum spanning tree | |

print.igraphHRG | Print a hierarchical random graph model to the screen | |

sample_growing | Growing random graph generation | |

rev.igraph.es | Reverse the order in an edge sequence | |

print.igraphHRGConsensus | Print a hierarchical random graph consensus tree to the screen | |

plot_dendrogram | Community structure dendrogram plots | |

neighbors | Neighboring (adjacent) vertices in a graph | |

path | Helper function to add or delete edges along a path | |

plot_dendrogram.igraphHRG | HRG dendrogram plot | |

permute | Permute the vertices of a graph | |

sample_fitness | Random graphs from vertex fitness scores | |

printer_callback | Create a printer callback function | |

sample_dot_product | Generate random graphs according to the random dot product graph model | |

sample_islands | A graph with subgraphs that are each a random graph. | |

r_pal | The default R palette | |

sample_pref | Trait-based random generation | |

sample_sbm | Sample stochastic block model | |

scan_stat | Scan statistics on a time series of graphs | |

sample_traits_callaway | Graph generation based on different vertex types | |

sample_k_regular | Create a random regular graph | |

read_graph | Reading foreign file formats | |

layout_with_lgl | Large Graph Layout | |

reciprocity | Reciprocity of graphs | |

radius | Radius of a graph | |

random_walk | Random walk on a graph | |

sample_correlated_gnp_pair | Sample a pair of correlated G(n,p) random graphs | |

sample_correlated_gnp | Generate a new random graph from a given graph by randomly adding/removing edges | |

make_full_graph | Create a full graph | |

make_graph | Create an igraph graph from a list of edges, or a notable graph | |

layout_with_mds | Graph layout by multidimensional scaling | |

sample_motifs | Graph motifs | |

sample_ | Sample from a random graph model | |

sample_last_cit | Random citation graphs | |

sample_pa_age | Generate an evolving random graph with preferential attachment and aging | |

sample_pa | Generate scale-free graphs according to the Barabasi-Albert model | |

make_star | Create a star graph, a tree with n vertices and n - 1 leaves | |

scg_eps | Error of the spectral coarse graining (SCG) approximation | |

scg_group | SCG Problem Solver | |

make_tree | Create tree graphs | |

min_cut | Minimum cut in a graph | |

merge_coords | Merging graph layouts | |

set_vertex_attr | Set vertex attributes | |

srand | Deprecated function, used to set random seed of the C library's RNG | |

shapes | Various vertex shapes when plotting igraph graphs | |

sample_bipartite | Bipartite random graphs | |

similarity | Similarity measures of two vertices | |

sample_hierarchical_sbm | Sample the hierarchical stochastic block model | |

st_cuts | List all (s,t)-cuts of a graph | |

st_min_cuts | List all minimum \((s,t)\)-cuts of a graph | |

stochastic_matrix | Stochastic matrix of a graph | |

sample_sphere_surface | Sample vectors uniformly from the surface of a sphere | |

sample_hrg | Sample from a hierarchical random graph model | |

strength | Strength or weighted vertex degree | |

[.igraph | Query and manipulate a graph as it were an adjacency matrix | |

simplified | Constructor modifier to drop multiple and loop edges | |

sample_gnm | Generate random graphs according to the G(n,m) Erdos-Renyi model | |

unique.igraph.es | Remove duplicate edges from an edge sequence | |

union.igraph.vs | Union of vertex sequences | |

which_multiple | Find the multiple or loop edges in a graph | |

which_mutual | Find mutual edges in a directed graph | |

without_attr | Construtor modifier to remove all attributes from a graph | |

normalize | Normalize layout | |

sample_gnp | Generate random graphs according to the G(n,p) Erdos-Renyi model | |

predict_edges | Predict edges based on a hierarchical random graph model | |

without_loops | Constructor modifier to drop loop edges | |

sample_smallworld | The Watts-Strogatz small-world model | |

page_rank | The Page Rank algorithm | |

set_edge_attr | Set edge attributes | |

sample_seq | Sampling a random integer sequence | |

vertex_attr | Query vertex attributes of a graph | |

triad_census | Triad census, subgraphs with three vertices | |

vertex_attr<- | Set one or more vertex attributes | |

transitivity | Transitivity of a graph | |

tail_of | Tails of the edge(s) in a graph | |

tkigraph | Experimental basic igraph GUI | |

tkplot | Interactive plotting of graphs | |

sample_sphere_volume | Sample vectors uniformly from the volume of a sphere | |

topo_sort | Topological sorting of vertices in a graph | |

rglplot | 3D plotting of graphs with OpenGL | |

print.igraph | Print graphs to the terminal | |

running_mean | Running mean of a time series | |

sample_fitness_pl | Scale-free random graphs, from vertex fitness scores | |

vertex_attr_names | List names of vertex attributes | |

with_igraph_opt | Run code with a temporary igraph options setting | |

subgraph_isomorphic | Decide if a graph is subgraph isomorphic to another one | |

subgraph_isomorphisms | All isomorphic mappings between a graph and subgraphs of another graph | |

set_graph_attr | Set a graph attribute | |

with_vertex_ | Constructor modifier to add vertex attributes | |

vertex_connectivity | Vertex connectivity. | |

sample_forestfire | Forest Fire Network Model | |

scg_semi_proj | Semi-Projectors | |

union.igraph.es | Union of edge sequences | |

union.igraph | Union of graphs | |

scg-method | Spectral Coarse Graining | |

sequential_pal | Sequential palette | |

simplify | Simple graphs | |

unique.igraph.vs | Remove duplicate vertices from a vertex sequence | |

time_bins.sir | SIR model on graphs | |

[[.igraph | Query and manipulate a graph as it were an adjacency list | |

scg | All-in-one Function for the SCG of Matrices and Graphs | |

spectrum | Eigenvalues and eigenvectors of the adjacency matrix of a graph | |

upgrade_graph | Igraph data structure versions | |

without_multiples | Constructor modifier to drop multiple edges | |

write_graph | Writing the graph to a file in some format | |

subcomponent | In- or out- component of a vertex | |

split_join_distance | Split-join distance of two community structures | |

with_edge_ | Constructor modifier to add edge attributes | |

subgraph | Subgraph of a graph | |

subgraph_centrality | Find subgraph centrality scores of network positions | |

with_graph_ | Constructor modifier to add graph attributes | |

union | Union of two or more sets | |

unfold_tree | Convert a general graph into a forest | |

vertex | Helper function for adding and deleting vertices | |

Pie charts as vertices | Using pie charts as vertices in graph plots | |

alpha_centrality | Find Bonacich alpha centrality scores of network positions | |

add_vertices | Add vertices to a graph | |

add_layout_ | Add layout to graph | |

are_adjacent | Are two vertices adjacent? | |

as_ids | Convert a vertex or edge sequence to an ordinary vector | |

as_incidence_matrix | Incidence matrix of a bipartite graph | |

No Results! |

## Last month downloads

## Details

License | GPL (>= 2) |

URL | https://igraph.org |

SystemRequirements | gmp (optional), libxml2 (optional), glpk (optional) |

BugReports | https://github.com/igraph/igraph/issues |

Encoding | UTF-8 |

RoxygenNote | 7.1.1 |

Collate | 'adjacency.R' 'auto.R' 'assortativity.R' 'attributes.R' 'basic.R' 'bipartite.R' 'centrality.R' 'centralization.R' 'cliques.R' 'cocitation.R' 'cohesive.blocks.R' 'community.R' 'components.R' 'console.R' 'conversion.R' 'data_frame.R' 'decomposition.R' 'degseq.R' 'demo.R' 'embedding.R' 'epi.R' 'fit.R' 'flow.R' 'foreign.R' 'games.R' 'glet.R' 'hrg.R' 'igraph-package.R' 'incidence.R' 'indexing.R' 'interface.R' 'iterators.R' 'layout.R' 'layout_drl.R' 'lazyeval.R' 'make.R' 'minimum.spanning.tree.R' 'motifs.R' 'nexus.R' 'operators.R' 'other.R' 'package.R' 'palette.R' 'par.R' 'paths.R' 'plot.R' 'plot.common.R' 'plot.shapes.R' 'pp.R' 'print.R' 'printr.R' 'random_walk.R' 'rewire.R' 'scan.R' 'scg.R' 'sgm.R' 'similarity.R' 'simple.R' 'sir.R' 'socnet.R' 'sparsedf.R' 'structural.properties.R' 'structure.info.R' 'test.R' 'tkplot.R' 'topology.R' 'triangles.R' 'utils.R' 'uuid.R' 'versions.R' 'weakref.R' 'zzz-deprecate.R' |

NeedsCompilation | yes |

Packaged | 2020-10-06 10:36:22 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2020-10-06 12:40:05 UTC |

#### Include our badge in your README

```
[![Rdoc](http://www.rdocumentation.org/badges/version/igraph)](http://www.rdocumentation.org/packages/igraph)
```