Learn R Programming

⚠️There's a newer version (1.3.5) of this package.Take me there.

igraph (version 1.2.4.1)

Network Analysis and Visualization

Description

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.

Copy Link

Version

Install

install.packages('igraph')

Monthly Downloads

432,884

Version

1.2.4.1

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

April 22nd, 2019

Functions in igraph (1.2.4.1)

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Are two vertices adjacent?

arpack_defaults

ARPACK eigenvector calculation

articulation_points

Articulation points of a graph

bipartite_mapping

Decide whether a graph is bipartite

bipartite_projection

Project a bipartite graph

Centralize a graph according to the degrees of vertices

centr_degree_tmax

Theoretical maximum for degree centralization

cluster_label_prop

Finding communities based on propagating labels

cluster_leading_eigen

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

cluster_louvain

Finding community structure by multi-level optimization of modularity

cluster_optimal

Optimal community structure

component_distribution

Connected components of a graph

Compose two graphs as binary relations

Optimal edge curvature when plotting graphs

Decompose a graph into components

Shortest (directed or undirected) paths between vertices

Diverging palette

edge_attr_names

List names of edge attributes

edge_connectivity

Edge connectivity.

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Convert object to a graph

Set all or some graph attributes

graph_from_literal

Creating (small) graphs via a simple interface

Get the id of a graph

Head of the edge(s) in a graph

Print the only the head of an R object

Getting and setting graph attributes, shortcut

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Convert between directed and undirected graphs

Conversion to igraph

Number of automorphisms

laplacian_matrix

Graph Laplacian

Edges of a graph

layout.reingold.tilford

Deprecated layout functions

The Davidson-Harel layout algorithm

layout_with_drl

The DrL graph layout generator

estimate_betweenness

Vertex and edge betweenness centrality

Vertices of a graph

as_adjacency_matrix

Convert a graph to an adjacency matrix

make_chordal_ring

Create an extended chordal ring graph

Adjacency lists

Centralize a graph according to the betweenness of vertices

canonical_permutation

Canonical permutation of a graph

categorical_pal

Palette for categories

Creates a communities object.

cluster_fast_greedy

Community structure via greedy optimization of modularity

centr_betw_tmax

Theoretical maximum for betweenness centralization

cluster_infomap

Infomap community finding

Burt's constraint

Contract several vertices into a single one

Centralization of a graph

count_subgraph_isomorphisms

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

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

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

Create tree graphs

count_triangles

Find triangles in graphs

modularity.igraph

Modularity of a community structure of a graph

Cocitation coupling

cohesive_blocks

Calculate Cohesive Blocks

Set one or more edge attributes

Query edge attributes of a graph

graph_from_atlas

Create a graph from the Graph Atlas

Create a consensus tree from several hierarchical random graph models

The igraph console

Degree and degree distribution of the vertices

graph_from_edgelist

Create a graph from an edge list matrix

Creating igraph graphs from data frames or vice-versa

graph_from_graphdb

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

Helper function to add or delete edges along a path

Permute the vertices of a graph

Create an igraph graph from a hierarchical random graph model

Kleinberg's hub centrality scores.

delete_edge_attr

Delete an edge attribute

igraph-es-indexing

Indexing edge sequences

igraph-es-indexing2

Select edges and show their metadata

Indent a printout

Intersection of two or more sets

Check whether a graph is directed

Predict edges based on a hierarchical random graph model

Is a degree sequence graphical?

Average nearest neighbor degree

layout_as_bipartite

Simple two-row layout for bipartite graphs

Graph rewiring while preserving the degree distribution

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

Dimensionality selection for singular values using profile likelihood.

Print graphs to the terminal

Disjoint union of graphs

The Fruchterman-Reingold layout algorithm

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

layout_with_gem

The GEM layout algorithm

make_full_graph

Create a full graph

Fit a hierarchical random graph model

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

Reverse the order in an edge sequence

Reverse the order in a vertex sequence

Girth of a graph

The igraph package

Add edges to a graph

Convert a vertex or edge sequence to an ordinary vector

sample_correlated_gnp_pair

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

Generate random graphs with a given degree sequence

print.nexusDatasetInfo

Query and download from the Nexus network repository

Order (number of vertices) of a graph

Normalize coordinates for plotting graphs

Growing random graph generation

Plotting of graphs

identical_graphs

Decide if two graphs are identical

Plotting the results on multiple SIR model runs

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Incident edges of a vertex in a graph

print.igraph.es

Print an edge sequence to the screen

print.igraph.vs

Show a vertex sequence on the screen

as_incidence_matrix

Incidence matrix of a bipartite graph

as_long_data_frame

Convert a graph to a long data frame

Reciprocity of graphs

Incident edges of multiple vertices in a graph

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Directed acyclic graphs

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

Replicate a graph multiple times

Declare a numeric vector as a membership vector

Choose an appropriate graph layout algorithm automatically

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

sample_traits_callaway

Graph generation based on different vertex types

SCG Problem Solver

Simple grid layout

sample_bipartite

Bipartite random graphs

sample_correlated_gnp

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

Semi-Projectors

Constructor modifier to drop multiple and loop edges

Centralize a graph according to the eigenvector centrality of vertices

Scan statistics on a time series of graphs

make_de_bruijn_graph

De Bruijn graphs

Spectral Coarse Graining

Union of two or more sets

Union of graphs

centr_eigen_tmax

Theoretical maximum for betweenness centralization

cluster_spinglass

Finding communities in graphs based on statistical meachanics

count_isomorphisms

Count the number of isomorphic mappings between two graphs

cluster_walktrap

Community strucure via short random walks

Query vertex attributes of a graph

make_empty_graph

A graph with no edges

stochastic_matrix

Stochastic matrix of a graph

Strength or weighted vertex degree

Topological sorting of vertices in a graph

vertex_attr_names

List names of vertex attributes

Writing the graph to a file in some format

Transitivity of a graph

delete_graph_attr

Delete a graph attribute

Delete edges from a graph

Match Graphs given a seeding of vertex correspondences

Pie charts as vertices

Using pie charts as vertices in graph plots

Set one or more vertex attributes

Difference of two sets

Find mutual edges in a directed graph

difference.igraph

Difference of graphs

Eccentricity of the vertices in a graph

Helper function for adding and deleting edges

Minimum spanning tree

Neighboring (adjacent) vertices in a graph

Constructor modifier to add edge attributes

Normalize layout

Neighborhood of graph vertices

Graph attributes of a graph

graph_attr_names

List names of graph attributes

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

The Page Rank algorithm

print.igraphHRG

Print a hierarchical random graph model to the screen

graph_from_incidence_matrix

Create graphs from an incidence matrix

Run igraph demos, step by step

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

The default R palette

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

Parameters for the igraph package

sample_k_regular

Create a random regular graph

sample_last_cit

Random citation graphs

Run package tests

Query igraph's version string

Generate an evolving random graph with preferential attachment and aging

Trait-based random generation

Eigenvalues and eigenvectors of the adjacency matrix of a graph

SIR model on graphs

is_printer_callback

Is this a printer callback?

subgraph_centrality

Find subgraph centrality scores of network positions

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

union.igraph.es

Union of edge sequences

union.igraph.vs

Union of vertex sequences

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

vertex_connectivity

Vertex connectivity.

Find the multiple or loop edges in a graph

Spring layout, this was removed from igraph

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Constructor modifier to drop loop edges

without_multiples

Constructor modifier to drop multiple edges

layout_randomly

Randomly place vertices on a plane or in 3d space

layout_with_graphopt

The graphopt layout algorithm

The Kamada-Kawai layout algorithm

make_full_bipartite_graph

Create a full bipartite graph

Add layout to graph

Add vertices to a graph

make_full_citation_graph

Create a complete (full) citation graph

Assortativity coefficient

Create a ring graph

make_line_graph

Line graph of a graph

Minimum size vertex separators

authority_score

Kleinberg's authority centrality scores.

Concatenate edge sequences

Concatenate vertex sequences

Magrittr's pipes

min_st_separators

Minimum size vertex separators

Complementer of a graph

printer_callback

Create a printer callback function

Component-wise layout

Better printing of R packages

Convex hull of a set of vertices

Running mean of a time series

Sample from a random graph model

K-core decomposition of graphs

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

delete_vertex_attr

Delete a vertex attribute

Geometric random graphs

sample_smallworld

The Watts-Strogatz small-world model

delete_vertices

Delete vertices from a graph

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Depth-first search

Sequential palette

Diameter of a graph

Set edge attributes

Various vertex shapes when plotting igraph graphs

Graph diversity

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Similarity measures of two vertices

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Incident vertices of some graph edges

all_simple_paths

List all simple paths from one source

Igraph data structure versions

In- or out- component of a vertex

Subgraph of a graph

Graphlet decomposition of a graph

Triad census, subgraphs with three vertices

Delete vertices or edges from a graph

Create a hierarchical random graph from an igraph graph

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Hierarchical random graphs

Vertex separators

Convert a general graph into a forest

intersection.igraph

Intersection of graphs

intersection.igraph.es

Intersection of edge sequences

Convert a graph to an edge list

Calculate all isomorphic mappings between the vertices of two graphs

SVD layout, this was removed from igraph

Weighted graphs

Convert igraph graphs to graphNEL objects from the graph package

Independent vertex sets

Breadth-first search

biconnected_components

Biconnected components

layout_with_lgl

Large Graph Layout

layout_with_mds

Graph layout by multidimensional scaling

Centralize a graph according to the closeness of vertices

max_cardinality

Maximum cardinality search

Theoretical maximum for closeness centralization

Maximum flow in a graph

Closeness centrality of vertices

Merging graph layouts

Functions to deal with the result of network community detection

cluster_edge_betweenness

Community structure detection based on edge betweenness

Compares community structures using various metrics

Minimum cut in a graph

difference.igraph.es

Difference of edge sequences

plot_dendrogram

Community structure dendrogram plots

plot_dendrogram.igraphHRG

HRG dendrogram plot

Add vertices, edges or another graph to a graph

difference.igraph.vs

Difference of vertex sequences

Rewiring edges of a graph

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

sample_forestfire

Forest Fire Network Model

3D plotting of graphs with OpenGL

Dyad census of a graph

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

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

Fitting a power-law distribution function to discrete data

Find the edge ids based on the incident vertices of the edges

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

graph_from_adj_list

Create graphs from adjacency lists

graph_from_isomorphism_class

Create a graph from an isomorphism class

graph_from_adjacency_matrix

Create graphs from adjacency matrices

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

Creating a graph from LCF notation

Groups of a vertex partitioning

Error of the spectral coarse graining (SCG) approximation

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

split_join_distance

Split-join distance of two community structures

The size of the graph (number of edges)

Query and manipulate a graph as it were an adjacency matrix

Query and manipulate a graph as it were an adjacency list

Experimental basic igraph GUI

Interactive plotting of graphs

igraph-vs-indexing

Indexing vertex sequences

Igraph data structure versions

Helper function for adding and deleting vertices

igraph-vs-indexing2

Select vertices and show their metadata

intersection.igraph.vs

Intersection of vertex sequences

Constructor modifier to add vertex attributes

Construtor modifier to remove all attributes from a graph

Chordality of a graph

Is this object an igraph graph?

is_min_separator

Minumal vertex separators

Decide if two graphs are isomorphic

isomorphism_class

Isomorphism class of a graph

The Reingold-Tilford graph layout algorithm

layout_in_circle

Graph layout with vertices on a circle.

layout_with_sugiyama

The Sugiyama graph layout generator

Compute local scan statistics on graphs

Make a new graph

Create a bipartite graph

make_kautz_graph

Create a lattice graph

Random walk on a graph

Reading foreign file formats

Random graphs from vertex fitness scores

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Sample from a hierarchical random graph model

A graph with subgraphs that are each a random graph.

Sample stochastic block model

Sampling a random integer sequence

Set a graph attribute

set_vertex_attr

Set vertex attributes

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

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

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Tails of the edge(s) in a graph

unique.igraph.es

Remove duplicate edges from an edge sequence

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Constructor modifier to add graph attributes

with_igraph_opt

Run code with a temporary igraph options setting