# igraph v1.2.4

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

E | Edges of a graph | |

add_layout_ | Add layout to graph | |

add_vertices | Add vertices to a graph | |

as_adjacency_matrix | Convert a graph to an adjacency matrix | |

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

assortativity | Assortativity coefficient | |

authority_score | Kleinberg's authority centrality scores. | |

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

centr_degree_tmax | Theoretical maximum for degree centralization | |

as_incidence_matrix | Incidence matrix of a bipartite graph | |

arpack_defaults | ARPACK eigenvector calculation | |

cluster_label_prop | Finding communities based on propagating labels | |

articulation_points | Articulation points of a graph | |

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

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

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

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

c.igraph.es | Concatenate edge sequences | |

compare | Compares community structures using various metrics | |

c.igraph.vs | Concatenate vertex sequences | |

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

count_motifs | Graph motifs | |

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

diverging_pal | Diverging palette | |

edge_attr_names | List names of edge attributes | |

bfs | Breadth-first search | |

closeness | Closeness centrality of vertices | |

igraph-package | The igraph package | |

add_edges | Add edges to a graph | |

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

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

all_simple_paths | List all simple paths from one source | |

cluster_fast_greedy | Community structure via greedy optimization of modularity | |

cluster_edge_betweenness | Community structure detection based on edge betweenness | |

convex_hull | Convex hull of a set of vertices | |

as_edgelist | Convert a graph to an edge list | |

biconnected_components | Biconnected components | |

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

automorphisms | Number of automorphisms | |

are_adjacent | Are two vertices adjacent? | |

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

edge_connectivity | Edge connectivity. | |

coreness | K-core decomposition of graphs | |

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

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

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

centr_betw_tmax | Theoretical maximum for betweenness centralization | |

estimate_betweenness | Vertex and edge betweenness centrality | |

as.igraph | Conversion to igraph | |

delete_vertex_attr | Delete a vertex attribute | |

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

bipartite_mapping | Decide whether a graph is bipartite | |

cluster_infomap | Infomap community finding | |

igraph_demo | Run igraph demos, step by step | |

centr_clo_tmax | Theoretical maximum for closeness centralization | |

centralize | Centralization of a graph | |

igraph_options | Parameters for the igraph package | |

bipartite_projection | Project a bipartite graph | |

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

cluster_optimal | Optimal community structure | |

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

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

is_chordal | Chordality of a graph | |

laplacian_matrix | Graph Laplacian | |

layout.reingold.tilford | Deprecated layout functions | |

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

delete_vertices | Delete vertices from a graph | |

cluster_walktrap | Community strucure via short random walks | |

cocitation | Cocitation coupling | |

constraint | Burt's constraint | |

contract | Contract several vertices into a single one | |

canonical_permutation | Canonical permutation of a graph | |

cohesive_blocks | Calculate Cohesive Blocks | |

categorical_pal | Palette for categories | |

layout_as_tree | The Reingold-Tilford graph layout algorithm | |

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

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

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

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

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

delete_edges | Delete edges from a graph | |

console | The igraph console | |

centr_eigen_tmax | Theoretical maximum for betweenness centralization | |

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

complementer | Complementer of a graph | |

component_wise | Component-wise layout | |

layout_with_graphopt | The graphopt layout algorithm | |

component_distribution | Connected components of a graph | |

delete_graph_attr | Delete a graph attribute | |

compose | Compose two graphs as binary relations | |

layout_with_kk | The Kamada-Kawai layout algorithm | |

count_triangles | Find triangles in graphs | |

dyad_census | Dyad census of a graph | |

curve_multiple | Optimal edge curvature when plotting graphs | |

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

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

ends | Incident vertices of some graph edges | |

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

disjoint_union | Disjoint union of graphs | |

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

graph_from_atlas | Create a graph from the Graph Atlas | |

make_ | Make a new graph | |

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

dfs | Depth-first search | |

fit_hrg | Fit a hierarchical random graph model | |

degree | Degree and degree distribution of the vertices | |

delete_edge_attr | Delete an edge attribute | |

diameter | Diameter of a graph | |

difference | Difference of two sets | |

decompose | Decompose a graph into components | |

eccentricity | Eccentricity of the vertices in a graph | |

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

graph_attr | Graph attributes of a graph | |

difference.igraph | Difference of graphs | |

graph_version | Igraph data structure versions | |

diversity | Graph diversity | |

is_bipartite | Create a bipartite graph | |

edge_attr | Query edge attributes of a graph | |

graphlet_basis | Graphlet decomposition of a graph | |

edge | Helper function for adding and deleting edges | |

graph_attr_names | List names of graph attributes | |

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

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

hub_score | Kleinberg's hub centrality scores. | |

is_named | Named graphs | |

make_ring | Create a ring graph | |

make_line_graph | Line graph of a graph | |

mst | Minimum spanning tree | |

dominator_tree | Dominator tree | |

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

is_printer_callback | Is this a printer callback? | |

eigen_centrality | Find Eigenvector Centrality Scores of Network Positions | |

graph_from_isomorphism_class | Create a graph from an isomorphism class | |

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

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

normalize | Normalize layout | |

edge_density | Graph density | |

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

page_rank | The Page Rank algorithm | |

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

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

embed_adjacency_matrix | Spectral Embedding of Adjacency Matrices | |

graph_from_lcf | Creating a graph from LCF notation | |

ego_size | Neighborhood of graph vertices | |

graph_ | Convert object to a graph | |

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

hrg-methods | Hierarchical random graphs | |

layout_with_fr | The Fruchterman-Reingold layout algorithm | |

layout_with_gem | The GEM layout algorithm | |

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

graph_from_adj_list | Create graphs from adjacency lists | |

igraph-vs-indexing | Indexing vertex sequences | |

make_full_bipartite_graph | Create a full bipartite graph | |

girth | Girth of a graph | |

graph_from_adjacency_matrix | Create graphs from adjacency matrices | |

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

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

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

intersection | Intersection of two or more sets | |

indent_print | Indent a printout | |

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

graph_from_incidence_matrix | Create graphs from an incidence matrix | |

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

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

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

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

is_igraph | Is this object an igraph graph? | |

graph_id | Get the id of a graph | |

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

groups | Groups of a vertex partitioning | |

identical_graphs | Decide if two graphs are identical | |

random_walk | Random walk on a graph | |

upgrade_graph | Igraph data structure versions | |

stochastic_matrix | Stochastic matrix of a graph | |

strength | Strength or weighted vertex degree | |

similarity | Similarity measures of two vertices | |

unfold_tree | Convert a general graph into a forest | |

read_graph | Reading foreign file formats | |

shapes | Various vertex shapes when plotting igraph graphs | |

triad_census | Triad census, subgraphs with three vertices | |

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

is_min_separator | Minumal vertex separators | |

igraph-es-indexing | Indexing edge sequences | |

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

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

vertex | Helper function for adding and deleting vertices | |

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

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

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

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

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

is_directed | Check whether a graph is directed | |

igraph_test | Run package tests | |

ivs | Independent vertex sets | |

igraph_version | Query igraph's version string | |

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

layout_with_lgl | Large Graph Layout | |

make_tree | Create tree graphs | |

intersection.igraph | Intersection of graphs | |

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

layout_with_mds | Graph layout by multidimensional scaling | |

is_dag | Directed acyclic graphs | |

motifs | Graph motifs | |

rewire | Rewiring edges of a graph | |

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

rglplot | 3D plotting of graphs with OpenGL | |

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

sample_ | Sample from a random graph model | |

is_graphical | Is a degree sequence graphical? | |

running_mean | Running mean of a time series | |

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

isomorphic | Decide if two graphs are isomorphic | |

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

isomorphism_class | Isomorphism class of a graph | |

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

make_de_bruijn_graph | De Bruijn graphs | |

make_empty_graph | A graph with no edges | |

keeping_degseq | Graph rewiring while preserving the degree distribution | |

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

is_separator | Vertex separators | |

knn | Average nearest neighbor degree | |

layout_ | Graph layouts | |

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

is_weighted | Weighted graphs | |

layout_with_sugiyama | The Sugiyama graph layout generator | |

sample_k_regular | Create a random regular graph | |

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

layout_with_dh | The Davidson-Harel layout algorithm | |

layout_nicely | Choose an appropriate graph layout algorithm automatically | |

layout_on_grid | Simple grid layout | |

make_chordal_ring | Create an extended chordal ring graph | |

sample_last_cit | Random citation graphs | |

sample_motifs | Graph motifs | |

layout_with_drl | The DrL graph layout generator | |

make_full_graph | Create a full graph | |

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

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

sequential_pal | Sequential palette | |

set_edge_attr | Set edge attributes | |

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

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

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

make_clusters | Creates a communities object. | |

make_kautz_graph | Kautz graphs | |

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

local_scan | Compute local scan statistics on graphs | |

%>% | Magrittr's pipes | |

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

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

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

norm_coords | Normalize coordinates for plotting graphs | |

Drawing graphs | Drawing graphs | |

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

make_lattice | Create a lattice graph | |

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

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

without_loops | Constructor modifier to drop loop edges | |

without_multiples | Constructor modifier to drop multiple edges | |

max_cardinality | Maximum cardinality search | |

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

sample_dirichlet | Sample from a Dirichlet distribution | |

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

max_flow | Maximum flow in a graph | |

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

sample_forestfire | Forest Fire Network Model | |

is_matching | Graph matching | |

plot_dendrogram | Community structure dendrogram plots | |

merge_coords | Merging graph layouts | |

plot_dendrogram.igraphHRG | HRG dendrogram plot | |

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

min_cut | Minimum cut in a graph | |

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

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

reciprocity | Reciprocity of graphs | |

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

min_separators | Minimum size vertex separators | |

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

sample_traits_callaway | Graph generation based on different vertex types | |

rep.igraph | Replicate a graph multiple times | |

permute | Permute the vertices of a graph | |

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

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

scg-method | Spectral Coarse Graining | |

min_st_separators | Minimum size vertex separators | |

subgraph | Subgraph of a graph | |

topo_sort | Topological sorting of vertices in a graph | |

transitivity | Transitivity of a graph | |

vertex_attr | Query vertex attributes of a graph | |

sample_bipartite | Bipartite random graphs | |

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

plot.igraph | Plotting of graphs | |

vertex_attr_names | List names of vertex attributes | |

printer_callback | Create a printer callback function | |

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

with_vertex_ | Constructor modifier to add vertex attributes | |

printr | Better printing of R packages | |

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

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

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

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

sample_hrg | Sample from a hierarchical random graph model | |

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

sample_hierarchical_sbm | Sample the hierarchical stochastic block model | |

sample_growing | Growing random graph generation | |

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

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

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

print.igraph | Print graphs to the terminal | |

sample_pref | Trait-based random generation | |

set_graph_attr | Set a graph attribute | |

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

r_pal | The default R palette | |

set_vertex_attr | Set vertex attributes | |

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

radius | Radius of a graph | |

sample_fitness | Random graphs from vertex fitness scores | |

time_bins.sir | SIR model on graphs | |

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

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

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

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

simplify | Simple graphs | |

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

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

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

sample_grg | Geometric random graphs | |

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

tkplot | Interactive plotting of graphs | |

tkigraph | Experimental basic igraph GUI | |

sample_sbm | Sample stochastic block model | |

sample_seq | Sampling a random integer sequence | |

scg_group | SCG Problem Solver | |

with_graph_ | Constructor modifier to add graph attributes | |

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

scg_semi_proj | Semi-Projectors | |

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

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

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

subgraph_centrality | Find subgraph centrality scores of network positions | |

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

which_mutual | Find mutual edges in a directed graph | |

with_edge_ | Constructor modifier to add edge attributes | |

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

union | Union of two or more sets | |

union.igraph | Union of graphs | |

vertex_connectivity | Vertex connectivity. | |

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

V | Vertices of a graph | |

as_adj_list | Adjacency lists | |

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-02-13 11:36:26 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2019-02-13 17:40:19 UTC |

#### Include our badge in your README

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