# igraph v1.0.1

0

Monthly downloads

by Gabor Csardi

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

is_directed | Check whether a graph is directed | |

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

make_ | Make a new graph | |

edge_attr_names | List names of edge attributes | |

hub_score | Kleinberg's hub centrality scores. | |

cohesive_blocks | Calculate Cohesive Blocks | |

c.igraph.es | Concatenate edge sequences | |

bipartite_projection | Project a bipartite graph | |

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

as_adj_list | Adjacency lists | |

as_incidence_matrix | Incidence matrix of a bipartite graph | |

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

cluster_label_prop | Finding communities based on propagating labels | |

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

c.igraph.vs | Concatenate vertex sequences | |

gclust.app | Graph Clustering Using NMF (and no SVT) -- Apparent Clusters | |

cluster_walktrap | Community strucure via short random walks | |

authority_score | Kleinberg's authority centrality scores. | |

compose | Compose two graphs as binary relations | |

estimate_betweenness | Vertex and edge betweenness centrality | |

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

add_vertices | Add vertices to a graph | |

layout_as_tree | The Reingold-Tilford graph layout algorithm | |

canonical_permutation | Canonical permutation of a graph | |

V | Vertices of a graph | |

console | The igraph console | |

all_simple_paths | List all simple paths from one source | |

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

add_edges | Add edges to a graph | |

automorphisms | Number of automorphisms | |

make_lattice | Create a lattice graph | |

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

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

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

contract | Contract several vertices into a single one | |

arpack_defaults | ARPACK eigenvector calculation | |

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

are_adjacent | Are two vertices adjacent? | |

coreness | K-core decomposition of graphs | |

cluster_optimal | Optimal community structure | |

as_edgelist | Convert a graph to an edge list | |

delete_edges | Delete edges from a graph | |

difference | Difference of two sets | |

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

ends | Incident vertices of some graph edges | |

count_triangles | Find triangles in graphs | |

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

centr_degree_tmax | Theoretical maximum for degree centralization | |

complementer | Complementer of a graph | |

dyad_census | Dyad census of a graph | |

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

girth | Girth of a graph | |

edge_density | Graph density | |

count_motifs | Graph motifs | |

edge | Helper function for adding and deleting edges | |

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

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

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

rep.igraph | Replicate a graph multiple times | |

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

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

delete_graph_attr | Delete a graph attribute | |

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

rglplot | 3D plotting of graphs with OpenGL | |

fit_hrg | Fit a hierarchical random graph model | |

igraph_version | Query igraph's version string | |

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

articulation_points | Articulation points of a graph | |

igraph-es-indexing | Indexing edge sequences | |

component_wise | Component-wise layout | |

graph_attr_names | List names of graph attributes | |

graph_from_lcf | Creating a graph from LCF notation | |

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

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

igraph_demo | Run igraph demos, step by step | |

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

edge_attr | Query edge attributes of a graph | |

ivs | Independent vertex sets | |

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

bipartite_mapping | Decide whether a graph is bipartite | |

igraph_test | Run package tests | |

dominator_tree | Dominator tree | |

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

layout.reingold.tilford | Deprecated layout functions | |

centralize | Centralization of a graph | |

keeping_degseq | Graph rewiring while preserving the degree distribution | |

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

isomorphic | Decide if two graphs are isomorphic | |

centr_clo_tmax | Theoretical maximum for closeness centralization | |

graph_from_adjacency_matrix | Create graphs from adjacency matrices | |

igraph_options | Parameters for the igraph package | |

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

make_full_bipartite_graph | Create a full bipartite graph | |

is_separator | Vertex separators | |

eigen_centrality | Find Eigenvector Centrality Scores of Network Positions | |

cluster_edge_betweenness | Community structure detection based on edge betweenness | |

plot_dendrogram.igraphHRG | HRG dendrogram plot | |

igraph-vs-indexing | Indexing vertex sequences | |

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

layout_on_grid | Simple grid layout | |

set_graph_attr | Set a graph attribute | |

is_graphical | Is a degree sequence graphical? | |

sample_grg | Geometric random graphs | |

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

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

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

graph_ | Convert object to a graph | |

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

min_cut | Minimum cut in a graph | |

layout_with_graphopt | The graphopt layout algorithm | |

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

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

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

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

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

laplacian_matrix | Graph Laplacian | |

make_tree | Create tree graphs | |

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

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

cluster_fast_greedy | Community structure via greedy optimization of modularity | |

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

scg-method | Spectral Coarse Graining | |

is_weighted | Weighted graphs | |

layout_with_kk | The Kamada-Kawai layout algorithm | |

as.igraph | Conversion to igraph | |

make_chordal_ring | Create an extended chordal ring graph | |

max_cardinality | Maximum cardinality search | |

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

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

compare | Compares community structures using various metrics | |

make_line_graph | Line graph of a graph | |

convex_hull | Convex hull of a set of vertices | |

layout_with_dh | The Davidson-Harel layout algorithm | |

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

motifs | Graph motifs | |

curve_multiple | Optimal edge curvature when plotting graphs | |

unfold_tree | Convert a general graph into a forest | |

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

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

min_separators | Minimum size vertex separators | |

sample_fitness | Random graphs from vertex fitness scores | |

cluster_infomap | Infomap community finding | |

ego | Neighborhood of graph vertices | |

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

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

max_flow | Maximum flow in a graph | |

diverging_pal | Diverging palette | |

sample_k_regular | Create a random regular graph | |

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

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

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

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

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

edge_connectivity | Edge connectivity. | |

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

add_layout_ | Add layout to graph | |

time_bins.sir | SIR model on graphs | |

subgraph_centrality | Find subgraph centrality scores of network positions | |

r_pal | The default R palette | |

E | Edges of a graph | |

Drawing graphs | Drawing graphs | |

tkigraph | Experimental basic igraph GUI | |

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

sample_forestfire | Forest Fire Network Model | |

embed_adjacency_matrix | Spectral Embedding of Adjacency Matrices | |

scg_semi_proj | Semi-Projectors | |

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

random_walk | Random walk on a graph | |

graphlet_basis | Graphlet decomposition of a graph | |

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

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

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

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

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

centr_betw_tmax | Theoretical maximum for betweenness centralization | |

transitivity | Transitivity of a graph | |

delete_vertices | Delete vertices from a graph | |

union | Union of two or more sets | |

as_adjacency_matrix | Convert a graph to an adjacency matrix | |

diameter | Diameter of a graph | |

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

sample_ | Sample from a random graph model | |

dfs | Depth-first search | |

sample_seq | Sampling a random integer sequence | |

hrg-methods | Hierarchical random graphs | |

vertex_connectivity | Vertex connectivity. | |

sample_sbm | Sample stochastic block model | |

layout_with_fr | The Fruchterman-Reingold layout algorithm | |

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

set_edge_attr | Set edge attributes | |

isomorphism_class | Isomorphism class of a graph | |

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

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

make_ring | Create a ring graph | |

is_named | Named graphs | |

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

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

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

is_chordal | Chordality of a graph | |

sample_motifs | Graph motifs | |

layout_nicely | Choose an appropriate graph layout algorithm automatically | |

without_multiples | Constructor modifier to drop multiple edges | |

layout_with_gem | The GEM layout algorithm | |

with_vertex_ | Constructor modifier to add vertex attributes | |

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

gclust.rsvt | Graph Clustering Using SVT and NMF -- Clusters Implied by Singular Value Thresholding | |

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

make_empty_graph | A graph with no edges | |

%>% | Magrittr's pipes | |

layout_with_lgl | Large Graph Layout | |

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

make_full_graph | Create a full graph | |

is_bipartite | Create a bipartite graph | |

sample_traits_callaway | Graph generation based on different vertex types | |

intersection | Intersection of two or more sets | |

layout_ | Graph layouts | |

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

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

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

make_de_bruijn_graph | De Bruijn graphs | |

make_clusters | Creates a communities object. | |

set_vertex_attr | Set vertex attributes | |

similarity | Similarity measures of two vertices | |

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

permute | Permute the vertices of a graph | |

shapes | Various vertex shapes when plotting igraph graphs | |

merge_coords | Merging graph layouts | |

categorical_pal | Palette for categories | |

stochastic_matrix | Stochastic matrix of a graph | |

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

delete_vertex_attr | Delete a vertex attribute | |

closeness | Closeness centrality of vertices | |

mst | Minimum spanning tree | |

tkplot | Interactive plotting of graphs | |

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

simplify | Simple graphs | |

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

vertex_attr | Query vertex attributes of a graph | |

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

bfs | Breadth-first search | |

graph_from_adj_list | Create graphs from adjacency lists | |

plot.igraph | Plotting of graphs | |

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

biconnected_components | Biconnected components | |

decompose | Decompose a graph into components | |

sample_hierarchical_sbm | Sample the hierarchical stochastic block model | |

layout_with_drl | The DrL graph layout generator | |

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

graph_attr | Graph attributes of a graph | |

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

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

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

sequential_pal | Sequential palette | |

topo_sort | Topological sorting of vertices in a graph | |

upgrade_graph | Igraph data structure versions | |

graph_from_isomorphism_class | Create a graph from an isomorphism class | |

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

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

page_rank | The Page Rank algorithm | |

is_matching | Graph matching | |

rewire | Rewiring edges of a graph | |

normalize | Normalize layout | |

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

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

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

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

norm_coords | Normalize coordinates for plotting graphs | |

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

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

with_edge_ | Constructor modifier to add edge attributes | |

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

union.igraph | Union of graphs | |

assortativity | Assortativity coefficient | |

constraint | Burt's constraint | |

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

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

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

graph_from_incidence_matrix | Create graphs from an incidence matrix | |

identical_graphs | Decide if two graphs are identical | |

centr_eigen_tmax | Theoretical maximum for betweenness centralization | |

getAICc | Compute AIC based on a Poisson Approximation using the output from gclust | |

graph_from_atlas | Create a graph from the Graph Atlas | |

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

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

is_igraph | Is this object an igraph graph? | |

running_mean | Running mean of a time series | |

print.igraph | Print graphs to the terminal | |

sample_last_cit | Random citation graphs | |

scg_group | SCG Problem Solver | |

strength | Strength or weighted vertex degree | |

vertex_attr_names | List names of vertex attributes | |

cocitation | Cocitation coupling | |

difference.igraph | Difference of graphs | |

disjoint_union | Disjoint union of graphs | |

eccentricity | Eccentricity of the vertices in a graph | |

diversity | Graph diversity | |

intersection.igraph | Intersection of graphs | |

make_kautz_graph | Kautz graphs | |

plot_dendrogram | Community structure dendrogram plots | |

read_graph | Reading foreign file formats | |

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

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

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

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

igraph-package | The igraph package | |

degree | Degree and degree distribution of the vertices | |

delete_edge_attr | Delete an edge attribute | |

vertex | Helper function for adding and deleting vertices | |

graph_version | Igraph data structure versions | |

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

is_min_separator | Minumal vertex separators | |

knn | Average nearest neighbor degree | |

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

radius | Radius of a graph | |

layout_with_mds | Graph layout by multidimensional scaling | |

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

component_distribution | Connected components of a graph | |

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

sample_pref | Trait-based random generation | |

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

sample_growing | Growing random graph generation | |

groups | Groups of a vertex partitioning | |

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

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

reciprocity | Reciprocity of graphs | |

min_st_separators | Minimum size vertex separators | |

sample_bipartite | Bipartite random graphs | |

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

subgraph | Subgraph of a graph | |

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

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

without_loops | Constructor modifier to drop loop edges | |

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

is_dag | Directed acyclic graphs | |

layout_with_sugiyama | The Sugiyama graph layout generator | |

local_scan | Compute local scan statistics on graphs | |

sample_dirichlet | Sample from a Dirichlet distribution | |

sample_hrg | Sample from a hierarchical random graph model | |

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

triad_census | Triad census, subgraphs with three vertices | |

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

with_graph_ | Constructor modifier to add graph attributes | |

which_mutual | Find mutual edges in a directed graph | |

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

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

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

%>% | Magrittr's pipes | |

No Results! |

## Last month downloads

## Details

License | GPL (>= 2) |

URL | http://igraph.org |

SystemRequirements | gmp, libxml2 |

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

Collate | 'adjacency.R' 'auto.R' 'assortativity.R' 'attributes.R' 'basic.R' 'bipartite.R' 'centrality.R' 'centralization.R' 'cliques.R' 'cocitation.R' 'cohesive.blocks.R' 'printr.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' 'mgclust.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' '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 | 2015-06-26 01:04:44 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2015-06-26 11:13:24 |

#### Include our badge in your README

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