# igraph v1.2.4.2

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 | |

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

all_simple_paths | List all simple paths from one source | |

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

as_incidence_matrix | Incidence matrix of a bipartite graph | |

bfs | Breadth-first search | |

biconnected_components | Biconnected components | |

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

centr_degree_tmax | Theoretical maximum for degree centralization | |

E | Edges of a graph | |

V | Vertices of a graph | |

articulation_points | Articulation points of a graph | |

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

arpack_defaults | ARPACK eigenvector calculation | |

centr_eigen_tmax | Theoretical maximum for betweenness centralization | |

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

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

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

convex_hull | Convex hull of a set of vertices | |

difference | Difference of two sets | |

count_triangles | Find triangles in graphs | |

coreness | K-core decomposition of graphs | |

cluster_walktrap | Community strucure via short random walks | |

igraph-package | The igraph package | |

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

difference.igraph | Difference of graphs | |

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

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

edge_attr_names | List names of edge attributes | |

centr_betw_tmax | Theoretical maximum for betweenness centralization | |

add_edges | Add edges to a graph | |

edge_connectivity | Edge connectivity. | |

hub_score | Kleinberg's hub centrality scores. | |

graph_ | Convert object to a graph | |

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

graph_version | Igraph data structure versions | |

ends | Incident vertices of some graph edges | |

cluster_infomap | Infomap community finding | |

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

cluster_fast_greedy | Community structure via greedy optimization of modularity | |

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

compose | Compose two graphs as binary relations | |

component_distribution | Connected components of a graph | |

cluster_optimal | Optimal community structure | |

as_adj_list | Adjacency lists | |

decompose | Decompose a graph into components | |

curve_multiple | Optimal edge curvature when plotting graphs | |

dfs | Depth-first search | |

diameter | Diameter of a graph | |

graph_from_atlas | Create a graph from the Graph Atlas | |

eccentricity | Eccentricity of the vertices in a graph | |

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

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

igraph-es-indexing | Indexing edge sequences | |

add_layout_ | Add layout to graph | |

add_vertices | Add vertices to a graph | |

as_adjacency_matrix | Convert a graph to an adjacency matrix | |

as_edgelist | Convert a graph to an edge list | |

are_adjacent | Are two vertices adjacent? | |

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

graphlet_basis | Graphlet decomposition of a graph | |

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

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

layout_ | Graph layouts | |

is_printer_callback | Is this a printer callback? | |

is_named | Named graphs | |

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

layout_with_drl | The DrL graph layout generator | |

intersection.igraph | Intersection of graphs | |

layout_with_dh | The Davidson-Harel layout algorithm | |

isomorphic | Decide if two graphs are isomorphic | |

edge | Helper function for adding and deleting edges | |

bipartite_projection | Project a bipartite graph | |

c.igraph.es | Concatenate edge sequences | |

bipartite_mapping | Decide whether a graph is bipartite | |

c.igraph.vs | Concatenate vertex sequences | |

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

isomorphism_class | Isomorphism class of a graph | |

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

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

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

igraph-vs-indexing | Indexing vertex sequences | |

graph_from_isomorphism_class | Create a graph from an isomorphism class | |

edge_density | Graph density | |

make_kautz_graph | Kautz graphs | |

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

ego_size | Neighborhood of graph vertices | |

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

graph_from_lcf | Creating a graph from LCF notation | |

as.igraph | Conversion to igraph | |

automorphisms | Number of automorphisms | |

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

estimate_betweenness | Vertex and edge betweenness centrality | |

assortativity | Assortativity coefficient | |

plot.igraph | Plotting of graphs | |

centr_clo_tmax | Theoretical maximum for closeness centralization | |

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

make_ | Make a new graph | |

is_weighted | Weighted graphs | |

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

is_separator | Vertex separators | |

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

complementer | Complementer of a graph | |

component_wise | Component-wise layout | |

cluster_label_prop | Finding communities based on propagating labels | |

constraint | Burt's constraint | |

contract | Contract several vertices into a single one | |

delete_edge_attr | Delete an edge attribute | |

degree | Degree and degree distribution of the vertices | |

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

centralize | Centralization of a graph | |

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

layout_with_fr | The Fruchterman-Reingold layout algorithm | |

max_flow | Maximum flow in a graph | |

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

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

authority_score | Kleinberg's authority centrality scores. | |

diverging_pal | Diverging palette | |

edge_attr | Query edge attributes of a graph | |

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

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

embed_adjacency_matrix | Spectral Embedding of Adjacency Matrices | |

make_lattice | Create a lattice graph | |

sample_fitness | Random graphs from vertex fitness scores | |

is_bipartite | Create a bipartite graph | |

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

norm_coords | Normalize coordinates for plotting graphs | |

printr | Better printing of R packages | |

canonical_permutation | Canonical permutation of a graph | |

categorical_pal | Palette for categories | |

sample_hrg | Sample from a hierarchical random graph model | |

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

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

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

make_clusters | Creates a communities object. | |

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

graph_attr | Graph attributes of a graph | |

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

printer_callback | Create a printer callback function | |

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

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

closeness | Closeness centrality of vertices | |

graph_attr_names | List names of graph attributes | |

eigen_centrality | Find Eigenvector Centrality Scores of Network Positions | |

groups | Groups of a vertex partitioning | |

is_min_separator | Minumal vertex separators | |

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

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

layout_nicely | Choose an appropriate graph layout algorithm automatically | |

make_chordal_ring | Create an extended chordal ring graph | |

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

cocitation | Cocitation coupling | |

count_motifs | Graph motifs | |

cohesive_blocks | Calculate Cohesive Blocks | |

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

delete_edges | Delete edges from a graph | |

is_igraph | Is this object an igraph graph? | |

cluster_edge_betweenness | Community structure detection based on edge betweenness | |

layout_with_gem | The GEM layout algorithm | |

max_cardinality | Maximum cardinality search | |

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

compare | Compares community structures using various metrics | |

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

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

scg-method | Spectral Coarse Graining | |

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

topo_sort | Topological sorting of vertices in a graph | |

make_full_bipartite_graph | Create a full bipartite graph | |

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

rglplot | 3D plotting of graphs with OpenGL | |

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

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

without_multiples | Constructor modifier to drop multiple edges | |

time_bins.sir | SIR model on graphs | |

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

without_loops | Constructor modifier to drop loop edges | |

sample_traits_callaway | Graph generation based on different vertex types | |

subgraph_centrality | Find subgraph centrality scores of network positions | |

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

transitivity | Transitivity of a graph | |

merge_coords | Merging graph layouts | |

%>% | Magrittr's pipes | |

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

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

motifs | Graph motifs | |

indent_print | Indent a printout | |

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

ivs | Independent vertex sets | |

layout_with_graphopt | The graphopt layout algorithm | |

intersection | Intersection of two or more sets | |

delete_graph_attr | Delete a graph attribute | |

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

console | The igraph console | |

delete_vertex_attr | Delete a vertex attribute | |

make_empty_graph | A graph with no edges | |

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

dominator_tree | Dominator tree | |

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

keeping_degseq | Graph rewiring while preserving the degree distribution | |

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

diversity | Graph diversity | |

fit_hrg | Fit a hierarchical random graph model | |

girth | Girth of a graph | |

igraph_options | Parameters for the igraph package | |

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

rewire | Rewiring edges of a graph | |

min_cut | Minimum cut in a graph | |

disjoint_union | Disjoint union of graphs | |

delete_vertices | Delete vertices from a graph | |

dyad_census | Dyad census of a graph | |

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

graph_from_incidence_matrix | Create graphs from an incidence matrix | |

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

identical_graphs | Decide if two graphs are identical | |

graph_id | Get the id of a graph | |

igraph_demo | Run igraph demos, step by step | |

layout_with_lgl | Large Graph Layout | |

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

igraph_test | Run package tests | |

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

layout_on_grid | Simple grid layout | |

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

normalize | Normalize layout | |

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

igraph_version | Query igraph's version string | |

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

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

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

hrg-methods | Hierarchical random graphs | |

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

graph_from_adj_list | Create graphs from adjacency lists | |

graph_from_adjacency_matrix | Create graphs from adjacency matrices | |

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

Drawing graphs | Drawing graphs | |

is_directed | Check whether a graph is directed | |

layout_with_kk | The Kamada-Kawai layout algorithm | |

sample_k_regular | Create a random regular graph | |

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

knn | Average nearest neighbor degree | |

make_de_bruijn_graph | De Bruijn graphs | |

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

is_graphical | Is a degree sequence graphical? | |

layout_with_mds | Graph layout by multidimensional scaling | |

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

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

sample_pref | Trait-based random generation | |

tkplot | Interactive plotting of graphs | |

make_line_graph | Line graph of a graph | |

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

laplacian_matrix | Graph Laplacian | |

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

make_ring | Create a ring graph | |

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

min_separators | Minimum size vertex separators | |

running_mean | Running mean of a time series | |

make_tree | Create tree graphs | |

min_st_separators | Minimum size vertex separators | |

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

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

sample_last_cit | Random citation graphs | |

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

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

page_rank | The Page Rank algorithm | |

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

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

random_walk | Random walk on a graph | |

sample_grg | Geometric random graphs | |

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

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

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

read_graph | Reading foreign file formats | |

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

is_chordal | Chordality of a graph | |

set_graph_attr | Set a graph attribute | |

is_dag | Directed acyclic graphs | |

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

layout_as_tree | The Reingold-Tilford graph layout algorithm | |

layout_with_sugiyama | The Sugiyama graph layout generator | |

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

subgraph | Subgraph of a graph | |

sample_ | Sample from a random graph model | |

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

tkigraph | Experimental basic igraph GUI | |

layout.reingold.tilford | Deprecated layout functions | |

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

sample_sbm | Sample stochastic block model | |

vertex_attr | Query vertex attributes of a graph | |

scg_semi_proj | Semi-Projectors | |

scg_group | SCG Problem Solver | |

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

sample_seq | Sampling a random integer sequence | |

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

sample_bipartite | Bipartite random graphs | |

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

plot_dendrogram | Community structure dendrogram plots | |

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

vertex_attr_names | List names of vertex attributes | |

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

with_edge_ | Constructor modifier to add edge attributes | |

which_mutual | Find mutual edges in a directed graph | |

local_scan | Compute local scan statistics on graphs | |

make_full_graph | Create a full graph | |

is_matching | Graph matching | |

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

permute | Permute the vertices of a graph | |

radius | Radius of a graph | |

r_pal | The default R palette | |

set_edge_attr | Set edge attributes | |

sample_forestfire | Forest Fire Network Model | |

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

sample_dirichlet | Sample from a Dirichlet distribution | |

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

sample_growing | Growing random graph generation | |

mst | Minimum spanning tree | |

print.igraph | Print graphs to the terminal | |

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

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

with_graph_ | Constructor modifier to add graph attributes | |

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

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

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

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

union | Union of two or more sets | |

plot_dendrogram.igraphHRG | HRG dendrogram plot | |

reciprocity | Reciprocity of graphs | |

rep.igraph | Replicate a graph multiple times | |

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

sequential_pal | Sequential palette | |

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

triad_census | Triad census, subgraphs with three vertices | |

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

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

sample_hierarchical_sbm | Sample the hierarchical stochastic block model | |

simplify | Simple graphs | |

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

sample_motifs | Graph motifs | |

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

stochastic_matrix | Stochastic matrix of a graph | |

shapes | Various vertex shapes when plotting igraph graphs | |

upgrade_graph | Igraph data structure versions | |

strength | Strength or weighted vertex degree | |

union.igraph | Union of graphs | |

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

set_vertex_attr | Set vertex attributes | |

with_vertex_ | Constructor modifier to add vertex attributes | |

unfold_tree | Convert a general graph into a forest | |

vertex | Helper function for adding and deleting vertices | |

similarity | Similarity measures of two vertices | |

vertex_connectivity | Vertex connectivity. | |

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

No Results! |

## Last month downloads

## Details

License | GPL (>= 2) |

URL | http://igraph.org |

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

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

Encoding | UTF-8 |

RoxygenNote | 6.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 | 2019-11-13 08:31:37 UTC; maechler |

Repository | CRAN |

Date/Publication | 2019-11-27 20:02:16 UTC |

#### Include our badge in your README

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