# igraph v1.2.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 | |

igraph-package | The igraph package | |

as.igraph | Conversion to igraph | |

bipartite_mapping | Decide whether a graph is bipartite | |

E | Edges of a graph | |

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

are_adjacent | Are two vertices adjacent? | |

bipartite_projection | Project a bipartite graph | |

V | Vertices of a graph | |

as_edgelist | Convert a graph to an edge list | |

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

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

c.igraph.es | Concatenate edge sequences | |

c.igraph.vs | Concatenate vertex sequences | |

as_incidence_matrix | Incidence matrix of a bipartite graph | |

bfs | Breadth-first search | |

biconnected_components | Biconnected components | |

assortativity | Assortativity coefficient | |

canonical_permutation | Canonical permutation of a graph | |

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

centr_eigen_tmax | Theoretical maximum for betweenness centralization | |

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

convex_hull | Convex hull of a set of vertices | |

cluster_optimal | Optimal community structure | |

coreness | K-core decomposition of graphs | |

categorical_pal | Palette for categories | |

complementer | Complementer of a graph | |

authority_score | Kleinberg's authority centrality scores. | |

component_wise | Component-wise layout | |

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

arpack_defaults | ARPACK eigenvector calculation | |

delete_edges | Delete edges from a graph | |

articulation_points | Articulation points of a graph | |

all_simple_paths | List all simple paths from one source | |

delete_graph_attr | Delete a graph attribute | |

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

centralize | Centralization of a graph | |

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

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

console | The igraph console | |

difference | Difference of two sets | |

eccentricity | Eccentricity of the vertices in a graph | |

difference.igraph | Difference of graphs | |

centr_betw_tmax | Theoretical maximum for betweenness centralization | |

edge | Helper function for adding and deleting edges | |

cluster_label_prop | Finding communities based on propagating labels | |

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

count_triangles | Find triangles in graphs | |

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

edge_attr | Query edge attributes of a graph | |

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

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

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

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

graph_from_atlas | Create a graph from the Graph Atlas | |

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

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

delete_vertex_attr | Delete a vertex attribute | |

add_layout_ | Add layout to graph | |

delete_vertices | Delete vertices from a graph | |

graph_version | Igraph data structure versions | |

add_vertices | Add vertices to a graph | |

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

cluster_walktrap | Community strucure via short random walks | |

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

graphlet_basis | Graphlet decomposition of a graph | |

as_adj_list | Adjacency lists | |

component_distribution | Connected components of a graph | |

fit_hrg | Fit a hierarchical random graph model | |

disjoint_union | Disjoint union of graphs | |

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

graph_ | Convert object to a graph | |

as_adjacency_matrix | Convert a graph to an adjacency matrix | |

compose | Compose two graphs as binary relations | |

automorphisms | Number of automorphisms | |

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

edge_attr_names | List names of edge attributes | |

hub_score | Kleinberg's hub centrality scores. | |

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

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

edge_connectivity | Edge connectivity. | |

estimate_betweenness | Vertex and edge betweenness centrality | |

curve_multiple | Optimal edge curvature when plotting graphs | |

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

igraph-vs-indexing | Indexing vertex sequences | |

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

decompose | Decompose a graph into components | |

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

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

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

is_igraph | Is this object an igraph graph? | |

is_chordal | Chordality of a graph | |

is_min_separator | Minumal vertex separators | |

graph_from_isomorphism_class | Create a graph from an isomorphism class | |

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

centr_clo_tmax | Theoretical maximum for closeness centralization | |

ivs | Independent vertex sets | |

cluster_fast_greedy | Community structure via greedy optimization of modularity | |

graph_id | Get the id of a graph | |

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

graph_from_lcf | Creating a graph from LCF notation | |

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

identical_graphs | Decide if two graphs are identical | |

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

cluster_infomap | Infomap community finding | |

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

ends | Incident vertices of some graph edges | |

hrg-methods | Hierarchical random graphs | |

centr_degree_tmax | Theoretical maximum for degree centralization | |

graph_from_adj_list | Create graphs from adjacency lists | |

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

layout_with_dh | The Davidson-Harel layout algorithm | |

closeness | Closeness centrality of vertices | |

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

graph_from_adjacency_matrix | Create graphs from adjacency matrices | |

compare | Compares community structures using various metrics | |

count_motifs | Graph motifs | |

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

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

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

layout_with_drl | The DrL graph layout generator | |

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

make_ | Make a new graph | |

degree | Degree and degree distribution of the vertices | |

igraph_demo | Run igraph demos, step by step | |

igraph_test | Run package tests | |

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

delete_edge_attr | Delete an edge attribute | |

cocitation | Cocitation coupling | |

cluster_edge_betweenness | Community structure detection based on edge betweenness | |

dfs | Depth-first search | |

igraph_version | Query igraph's version string | |

cohesive_blocks | Calculate Cohesive Blocks | |

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

constraint | Burt's constraint | |

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

is_bipartite | Create a bipartite graph | |

igraph_options | Parameters for the igraph package | |

is_dag | Directed acyclic graphs | |

indent_print | Indent a printout | |

intersection | Intersection of two or more sets | |

make_tree | Create tree graphs | |

diameter | Diameter of a graph | |

mst | Minimum spanning tree | |

is_named | Named graphs | |

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

dyad_census | Dyad census of a graph | |

intersection.igraph | Intersection of graphs | |

contract | Contract several vertices into a single one | |

normalize | Normalize layout | |

is_printer_callback | Is this a printer callback? | |

page_rank | The Page Rank algorithm | |

layout_with_lgl | Large Graph Layout | |

layout_with_mds | Graph layout by multidimensional scaling | |

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

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

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

diverging_pal | Diverging palette | |

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

keeping_degseq | Graph rewiring while preserving the degree distribution | |

make_chordal_ring | Create an extended chordal ring graph | |

knn | Average nearest neighbor degree | |

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

make_clusters | Creates a communities object. | |

layout_nicely | Choose an appropriate graph layout algorithm automatically | |

make_line_graph | Line graph of a graph | |

isomorphic | Decide if two graphs are isomorphic | |

make_ring | Create a ring graph | |

isomorphism_class | Isomorphism class of a graph | |

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

layout_on_grid | Simple grid layout | |

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

layout_with_fr | The Fruchterman-Reingold layout algorithm | |

diversity | Graph diversity | |

motifs | Graph motifs | |

make_full_bipartite_graph | Create a full bipartite graph | |

dominator_tree | Dominator tree | |

layout_with_gem | The GEM layout algorithm | |

sample_fitness | Random graphs from vertex fitness scores | |

plot_dendrogram | Community structure dendrogram plots | |

plot_dendrogram.igraphHRG | HRG dendrogram plot | |

printer_callback | Create a printer callback function | |

sample_growing | Growing random graph generation | |

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

eigen_centrality | Find Eigenvector Centrality Scores of Network Positions | |

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

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

edge_density | Graph density | |

printr | Better printing of R packages | |

embed_adjacency_matrix | Spectral Embedding of Adjacency Matrices | |

ego_size | Neighborhood of graph vertices | |

sample_hierarchical_sbm | Sample the hierarchical stochastic block model | |

girth | Girth of a graph | |

random_walk | Random walk on a graph | |

graph_attr | Graph attributes of a graph | |

read_graph | Reading foreign file formats | |

make_kautz_graph | Kautz graphs | |

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

make_lattice | Create a lattice graph | |

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

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

min_cut | Minimum cut in a graph | |

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

merge_coords | Merging graph layouts | |

graph_attr_names | List names of graph attributes | |

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

plot.igraph | Plotting of graphs | |

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

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

graph_from_incidence_matrix | Create graphs from an incidence matrix | |

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

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

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

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

groups | Groups of a vertex partitioning | |

sample_pref | Trait-based random generation | |

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

max_cardinality | Maximum cardinality search | |

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

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

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

time_bins.sir | SIR model on graphs | |

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

scg-method | Spectral Coarse Graining | |

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

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

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

igraph-es-indexing | Indexing edge sequences | |

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

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

is_separator | Vertex separators | |

shapes | Various vertex shapes when plotting igraph graphs | |

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

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

is_directed | Check whether a graph is directed | |

similarity | Similarity measures of two vertices | |

union | Union of two or more sets | |

is_graphical | Is a degree sequence graphical? | |

laplacian_matrix | Graph Laplacian | |

max_flow | Maximum flow in a graph | |

union.igraph | Union of graphs | |

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

is_weighted | Weighted graphs | |

vertex_connectivity | Vertex connectivity. | |

vertex_attr | Query vertex attributes of a graph | |

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

layout.reingold.tilford | Deprecated layout functions | |

layout_with_graphopt | The graphopt layout algorithm | |

layout_ | Graph layouts | |

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

which_mutual | Find mutual edges in a directed graph | |

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

vertex_attr_names | List names of vertex attributes | |

without_loops | Constructor modifier to drop loop edges | |

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

without_multiples | Constructor modifier to drop multiple edges | |

with_edge_ | Constructor modifier to add edge attributes | |

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

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

norm_coords | Normalize coordinates for plotting graphs | |

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

r_pal | The default R palette | |

permute | Permute the vertices of a graph | |

radius | Radius of a graph | |

sample_dirichlet | Sample from a Dirichlet distribution | |

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

layout_as_tree | The Reingold-Tilford graph layout algorithm | |

sample_k_regular | Create a random regular graph | |

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

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

layout_with_sugiyama | The Sugiyama graph layout generator | |

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

local_scan | Compute local scan statistics on graphs | |

reciprocity | Reciprocity of graphs | |

rep.igraph | Replicate a graph multiple times | |

sample_last_cit | Random citation graphs | |

layout_with_kk | The Kamada-Kawai layout algorithm | |

make_de_bruijn_graph | De Bruijn graphs | |

make_empty_graph | A graph with no edges | |

make_full_graph | Create a full graph | |

is_matching | Graph matching | |

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

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

sample_bipartite | Bipartite random graphs | |

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

sample_sbm | Sample stochastic block model | |

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

sample_hrg | Sample from a hierarchical random graph model | |

sample_seq | Sampling a random integer sequence | |

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

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

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

min_separators | Minimum size vertex separators | |

print.igraph | Print graphs to the terminal | |

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

rewire | Rewiring edges of a graph | |

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

subgraph_centrality | Find subgraph centrality scores of network positions | |

rglplot | 3D plotting of graphs with OpenGL | |

topo_sort | Topological sorting of vertices in a graph | |

min_st_separators | Minimum size vertex separators | |

transitivity | Transitivity of a graph | |

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

running_mean | Running mean of a time series | |

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

sequential_pal | Sequential palette | |

sample_traits_callaway | Graph generation based on different vertex types | |

set_edge_attr | Set edge attributes | |

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

sample_ | Sample from a random graph model | |

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

%>% | Magrittr's pipes | |

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

sample_grg | Geometric random graphs | |

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

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

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

Drawing graphs | Drawing graphs | |

sample_motifs | Graph motifs | |

tkigraph | Experimental basic igraph GUI | |

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

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

set_graph_attr | Set a graph attribute | |

sample_forestfire | Forest Fire Network Model | |

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

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

tkplot | Interactive plotting of graphs | |

scg_group | SCG Problem Solver | |

set_vertex_attr | Set vertex attributes | |

scg_semi_proj | Semi-Projectors | |

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

simplify | Simple graphs | |

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

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

subgraph | Subgraph of a graph | |

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

upgrade_graph | Igraph data structure versions | |

with_vertex_ | Constructor modifier to add vertex attributes | |

vertex | Helper function for adding and deleting vertices | |

stochastic_matrix | Stochastic matrix of a graph | |

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

strength | Strength or weighted vertex degree | |

triad_census | Triad census, subgraphs with three vertices | |

unfold_tree | Convert a general graph into a forest | |

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

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

with_graph_ | Constructor modifier to add graph attributes | |

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

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

add_edges | Add edges to 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 |

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

RoxygenNote | 6.0.1 |

NeedsCompilation | yes |

Packaged | 2018-07-27 08:53:48 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2018-07-27 14:50:02 UTC |

#### Include our badge in your README

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