igraph v1.2.1


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
as_adjacency_matrix Convert a graph to an adjacency matrix
bfs Breadth-first search
as_long_data_frame Convert a graph to a long data frame
centr_degree Centralize a graph according to the degrees of vertices
centr_degree_tmax Theoretical maximum for degree centralization
centr_eigen Centralize a graph according to the eigenvector centrality of vertices
count_isomorphisms Count the number of isomorphic mappings between two graphs
categorical_pal Palette for categories
centr_eigen_tmax Theoretical maximum for betweenness centralization
bipartite_mapping Decide whether a graph is bipartite
cluster_fast_greedy Community structure via greedy optimization of modularity
cluster_infomap Infomap community finding
cluster_optimal Optimal community structure
biconnected_components Biconnected components
canonical_permutation Canonical permutation of a graph
bipartite_projection Project a bipartite graph
cluster_walktrap Community strucure via short random walks
cluster_louvain Finding community structure by multi-level optimization of modularity
cluster_spinglass Finding communities in graphs based on statistical meachanics
constraint Burt's constraint
as_incidence_matrix Incidence matrix of a bipartite graph
estimate_betweenness Vertex and edge betweenness centrality
c.igraph.es Concatenate edge sequences
centr_clo Centralize a graph according to the closeness of vertices
c.igraph.vs Concatenate vertex sequences
assortativity Assortativity coefficient
centralize Centralization of a graph
automorphisms Number of automorphisms
as_membership Declare a numeric vector as a membership vector
contract Contract several vertices into a single one
count_subgraph_isomorphisms Count the isomorphic mappings between a graph and the subgraphs of another graph
centr_clo_tmax Theoretical maximum for closeness centralization
difference Difference of two sets
eccentricity Eccentricity of the vertices in a graph
cluster_label_prop Finding communities based on propagating labels
cluster_leading_eigen Community structure detecting based on the leading eigenvector of the community matrix
complementer Complementer of a graph
count_triangles Find triangles in graphs
difference.igraph Difference of graphs
cliques The functions find cliques, ie. complete subgraphs in a graph
component_wise Component-wise layout
authority_score Kleinberg's authority centrality scores.
get.edge.ids Find the edge ids based on the incident vertices of the edges
count_motifs Graph motifs
edge Helper function for adding and deleting edges
fit_power_law Fitting a power-law distribution function to discrete data
centr_betw Centralize a graph according to the betweenness of vertices
cocitation Cocitation coupling
centr_betw_tmax Theoretical maximum for betweenness centralization
component_distribution Connected components of a graph
consensus_tree Create a consensus tree from several hierarchical random graph models
closeness Closeness centrality of vertices
cohesive_blocks Calculate Cohesive Blocks
cluster_edge_betweenness Community structure detection based on edge betweenness
compose Compose two graphs as binary relations
compare Compares community structures using various metrics
graph_ Convert object to a graph
curve_multiple Optimal edge curvature when plotting graphs
convex_hull Convex hull of a set of vertices
membership Functions to deal with the result of network community detection
console The igraph console
delete_vertex_attr Delete a vertex attribute
delete_edges Delete edges from a graph
delete_graph_attr Delete a graph attribute
coreness K-core decomposition of graphs
dfs Depth-first search
graph_attr<- Set all or some graph attributes
delete_vertices Delete vertices from a graph
degree Degree and degree distribution of the vertices
graph_version Igraph data structure versions
graphlet_basis Graphlet decomposition of a graph
identical_graphs Decide if two graphs are identical
decompose Decompose a graph into components
distance_table Shortest (directed or undirected) paths between vertices
delete_edge_attr Delete an edge attribute
igraph-es-indexing Indexing edge sequences
igraph-attribute-combination How igraph functions handle attributes when the graph changes
difference.igraph.es Difference of edge sequences
dim_select Dimensionality selection for singular values using profile likelihood.
edge_attr_names List names of edge attributes
diameter Diameter of a graph
difference.igraph.vs Difference of vertex sequences
diverging_pal Diverging palette
disjoint_union Disjoint union of graphs
edge_attr<- Set one or more edge attributes
igraph-es-indexing2 Select edges and show their metadata
edge_connectivity Edge connectivity.
igraph_test Run package tests
diversity Graph diversity
dominator_tree Dominator tree
eigen_centrality Find Eigenvector Centrality Scores of Network Positions
graph_attr Graph attributes of a graph
edge_density Graph density
edge_attr Query edge attributes of a graph
graph_attr_names List names of graph attributes
graph_from_graphnel Convert graphNEL objects from the graph package to igraph
ego_size Neighborhood of graph vertices
embed_adjacency_matrix Spectral Embedding of Adjacency Matrices
graph_from_incidence_matrix Create graphs from an incidence matrix
girth Girth of a graph
gorder Order (number of vertices) of a graph
hrg-methods Hierarchical random graphs
hrg Create a hierarchical random graph from an igraph graph
graph_from_edgelist Create a graph from an edge list matrix
groups Groups of a vertex partitioning
erdos.renyi.game Generate random graphs according to the Erdos-Renyi model
igraph_version Query igraph's version string
graph_from_graphdb Load a graph from the graph database for testing graph isomorphism.
gsize The size of the graph (number of edges)
igraph_demo Run igraph demos, step by step
igraph-vs-indexing Indexing vertex sequences
fit_hrg Fit a hierarchical random graph model
igraph_options Parameters for the igraph package
indent_print Indent a printout
dyad_census Dyad census of a graph
each_edge Rewires the endpoints of the edges of a graph to a random vertex
igraph-vs-indexing2 Select vertices and show their metadata
embed_laplacian_matrix Spectral Embedding of the Laplacian of a Graph
incident Incident edges of a vertex in a graph
intersection Intersection of two or more sets
is_separator Vertex separators
is_directed Check whether a graph is directed
incident_edges Incident edges of multiple vertices in a graph
ends Incident vertices of some graph edges
graph_from_adj_list Create graphs from adjacency lists
isomorphic Decide if two graphs are isomorphic
graph_from_atlas Create a graph from the Graph Atlas
is_weighted Weighted graphs
is_graphical Is a degree sequence graphical?
graph_from_isomorphism_class Create a graph from an isomorphism class
isomorphisms Calculate all isomorphic mappings between the vertices of two graphs
graph_from_adjacency_matrix Create graphs from adjacency matrices
isomorphism_class Isomorphism class of a graph
ivs Independent vertex sets
as_data_frame Creating igraph graphs from data frames or vice-versa
layout_as_tree The Reingold-Tilford graph layout algorithm
graph_from_lcf Creating a graph from LCF notation
layout_in_circle Graph layout with vertices on a circle.
hrg_tree Create an igraph graph from a hierarchical random graph model
is_named Named graphs
layout.svd SVD layout, this was removed from igraph
layout_ Graph layouts
layout_with_fr The Fruchterman-Reingold layout algorithm
layout_with_gem The GEM layout algorithm
is_printer_callback Is this a printer callback?
make_full_graph Create a full graph
layout_with_dh The Davidson-Harel layout algorithm
graph_from_literal Creating (small) graphs via a simple interface
graph_id Get the id of a graph
layout_with_drl The DrL graph layout generator
hub_score Kleinberg's hub centrality scores.
make_graph Create an igraph graph from a list of edges, or a notable graph
head_of Head of the edge(s) in a graph
match_vertices Match Graphs given a seeding of vertex correspondences
igraph-minus Delete vertices or edges from 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
igraph-dollar Getting and setting graph attributes, shortcut
head_print Print the only the head of an R object
make_star Create a star graph, a tree with n vertices and n - 1 leaves
is_matching Graph matching
igraph-es-attributes Query or set attributes of the edges in an edge sequence
intersection.igraph.vs Intersection of vertex sequences
igraph-vs-attributes Query or set attributes of the vertices in a vertex sequence
%>% Magrittr's pipes
motifs Graph motifs
modularity.igraph Modularity of a community structure of a graph
make_tree Create tree graphs
knn Average nearest neighbor degree
intersection.igraph.es Intersection of edge sequences
intersection.igraph Intersection of graphs
is_dag Directed acyclic graphs
is_degseq Check if a degree sequence is valid for a multi-graph
Drawing graphs Drawing graphs
layout.reingold.tilford Deprecated layout functions
laplacian_matrix Graph Laplacian
print.nexusDatasetInfo Query and download from the Nexus network repository
norm_coords Normalize coordinates for plotting graphs
is_chordal Chordality of a graph
layout_nicely Choose an appropriate graph layout algorithm automatically
is_igraph Is this object an igraph graph?
printer_callback Create a printer callback function
layout_on_sphere Graph layout with vertices on the surface of a sphere
layout_on_grid Simple grid layout
layout_randomly Randomly place vertices on a plane or in 3d space
layout_with_sugiyama The Sugiyama graph layout generator
layout_with_lgl Large Graph Layout
layout_with_mds Graph layout by multidimensional scaling
printr Better printing of R packages
is_min_separator Minumal vertex separators
make_ Make a new graph
is_bipartite Create a bipartite graph
layout.fruchterman.reingold.grid Grid Fruchterman-Reingold layout, this was removed from igraph
make_kautz_graph Kautz graphs
make_lattice Create a lattice graph
plot.igraph Plotting of graphs
plot.sir Plotting the results on multiple SIR model runs
rewire Rewiring edges of a graph
local_scan Compute local scan statistics on graphs
make_chordal_ring Create an extended chordal ring graph
rglplot 3D plotting of graphs with OpenGL
sample_bipartite Bipartite random graphs
make_clusters Creates a communities object.
min_cut Minimum cut in a graph
merge_coords Merging graph layouts
print.igraphHRG Print a hierarchical random graph model to the screen
make_line_graph Line graph of a graph
make_ring Create a ring graph
layout.spring Spring layout, this was removed from igraph
path Helper function to add or delete edges along a path
min_separators Minimum size vertex separators
layout_as_bipartite Simple two-row layout for bipartite graphs
permute Permute the vertices of a graph
layout_as_star Generate coordinates to place the vertices of a graph in a star-shape
+.igraph Add vertices, edges or another graph to a graph
print.igraphHRGConsensus Print a hierarchical random graph consensus tree to the screen
rev.igraph.es Reverse the order in an edge sequence
rev.igraph.vs Reverse the order in a vertex sequence
layout_with_graphopt The graphopt layout algorithm
sample_correlated_gnp_pair Sample a pair of correlated G(n,p) random graphs
sample_correlated_gnp Generate a new random graph from a given graph by randomly adding/removing edges
layout_with_kk The Kamada-Kawai layout algorithm
sample_degseq Generate random graphs with a given degree sequence
make_full_bipartite_graph Create a full bipartite graph
make_full_citation_graph Create a complete (full) citation graph
sample_sphere_surface Sample vectors uniformly from the surface of a sphere
srand Deprecated function, used to set random seed of the C library's RNG
scg_semi_proj Semi-Projectors
max_cardinality Maximum cardinality search
split_join_distance Split-join distance of two community structures
scg_group SCG Problem Solver
sample_gnm Generate random graphs according to the G(n,m) Erdos-Renyi model
sample_forestfire Forest Fire Network Model
sample_smallworld The Watts-Strogatz small-world model
max_flow Maximum flow in a graph
mst Minimum spanning tree
power_centrality Find Bonacich Power Centrality Scores of Network Positions
sample_hrg Sample from a hierarchical random graph model
subgraph_centrality Find subgraph centrality scores of network positions
subgraph_isomorphic Decide if a graph is subgraph isomorphic to another one
random_walk Random walk on a graph
topo_sort Topological sorting of vertices in a graph
transitivity Transitivity of a graph
min_st_separators Minimum size vertex separators
read_graph Reading foreign file formats
normalize Normalize layout
neighbors Neighboring (adjacent) vertices in a graph
running_mean Running mean of a time series
sample_ Sample from a random graph model
sample_sphere_volume Sample vectors uniformly from the volume of a sphere
sample_islands A graph with subgraphs that are each a random graph.
predict_edges Predict edges based on a hierarchical random graph model
print.igraph Print graphs to the terminal
page_rank The Page Rank algorithm
sample_traits_callaway Graph generation based on different vertex types
sample_gnp Generate random graphs according to the G(n,p) Erdos-Renyi model
unique.igraph.es Remove duplicate edges from an edge sequence
sequential_pal Sequential palette
sample_grg Geometric random graphs
sample_pa_age Generate an evolving random graph with preferential attachment and aging
unique.igraph.vs Remove duplicate vertices from a vertex sequence
reciprocity Reciprocity of graphs
sample_pref Trait-based random generation
scan_stat Scan statistics on a time series of graphs
rep.igraph Replicate a graph multiple times
scg-method Spectral Coarse Graining
sample_dirichlet Sample from a Dirichlet distribution
plot_dendrogram Community structure dendrogram plots
write_graph Writing the graph to a file in some format
set_edge_attr Set edge attributes
st_cuts List all (s,t)-cuts of a graph
print.igraph.es Print an edge sequence to the screen
plot_dendrogram.igraphHRG HRG dendrogram plot
print.igraph.vs Show a vertex sequence on the screen
st_min_cuts List all minimum \((s,t)\)-cuts of a graph
simplified Constructor modifier to drop multiple and loop edges
r_pal The default R palette
simplify Simple graphs
sample_dot_product Generate random graphs according to the random dot product graph model
radius Radius of a graph
stochastic_matrix Stochastic matrix of a graph
sample_k_regular Create a random regular graph
sample_fitness Random graphs from vertex fitness scores
subcomponent In- or out- component of a vertex
sample_last_cit Random citation graphs
strength Strength or weighted vertex degree
sample_fitness_pl Scale-free random graphs, from vertex fitness scores
sample_sbm Sample stochastic block model
sample_seq Sampling a random integer sequence
triad_census Triad census, subgraphs with three vertices
unfold_tree Convert a general graph into a forest
sample_growing Growing random graph generation
vertex_connectivity Vertex connectivity.
scg_eps Error of the spectral coarse graining (SCG) approximation
subgraph Subgraph of a graph
union Union of two or more sets
scg All-in-one Function for the SCG of Matrices and Graphs
which_multiple Find the multiple or loop edges in a graph
which_mutual Find mutual edges in a directed graph
with_edge_ Constructor modifier to add edge attributes
sample_hierarchical_sbm Sample the hierarchical stochastic block model
union.igraph Union of graphs
time_bins.sir SIR model on graphs
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
sample_motifs Graph motifs
with_igraph_opt Run code with a temporary igraph options setting
sample_pa Generate scale-free graphs according to the Barabasi-Albert model
spectrum Eigenvalues and eigenvectors of the adjacency matrix 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
tkigraph Experimental basic igraph GUI
tkplot Interactive plotting of graphs
vertex_attr Query vertex attributes of a graph
set_graph_attr Set a graph attribute
vertex_attr_names List names of vertex attributes
set_vertex_attr Set vertex attributes
shapes Various vertex shapes when plotting igraph graphs
with_vertex_ Constructor modifier to add vertex attributes
similarity Similarity measures of two vertices
without_attr Construtor modifier to remove all attributes from a graph
subgraph_isomorphisms All isomorphic mappings between a graph and subgraphs of another graph
tail_of Tails of the edge(s) in a graph
union.igraph.es Union of edge sequences
union.igraph.vs Union of vertex sequences
upgrade_graph Igraph data structure versions
vertex Helper function for adding and deleting vertices
without_multiples Constructor modifier to drop multiple edges
without_loops Constructor modifier to drop loop edges
add_vertices Add vertices to a graph
adjacent_vertices Adjacent vertices of multiple vertices in a graph
add_layout_ Add layout to graph
all_simple_paths List all simple paths from one source
add_edges Add edges to a graph
igraph-package The igraph package
are_adjacent Are two vertices adjacent?
as_graphnel Convert igraph graphs to graphNEL objects from the graph package
E Edges of a graph
as_ids Convert a vertex or edge sequence to an ordinary vector
as_edgelist Convert a graph to an edge list
as.directed Convert between directed and undirected graphs
alpha_centrality Find Bonacich alpha centrality scores of network positions
articulation_points Articulation points of a graph
as_adj_list Adjacency lists
arpack_defaults ARPACK eigenvector calculation
V Vertices of a graph
as.igraph Conversion to igraph
No Results!

Last month downloads


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'
NeedsCompilation yes
Packaged 2018-03-10 12:30:48 UTC; gaborcsardi
Repository CRAN
Date/Publication 2018-03-10 21:33:20 UTC

Include our badge in your README