RDocumentation
Moon
Search all packages and functions
⚠️
There's a newer version (1.2.6) of this package.
Take me there.
Readme not available 😞
Copy Link
Copy
Link to current version
Version
Version
1.2.6
1.2.5
1.2.4.2
1.2.4.1
1.2.4
1.2.3
1.2.2
1.2.1
1.1.2
1.1.1
1.0.1
1.0.0
0.7.1
0.7.0
0.6.6
0.6.5-2
0.6.5-1
0.6.4
0.6-3
0.6-2
0.6-1
0.5.5-4
0.5.5-3
0.5.5-2
0.5.5-1
0.5.4-1
0.5.3
0.5.2-2
0.5.1
0.4.5
0.4.4
0.4.3
0.4.2
0.4.1
0.3.3
0.3.2
0.3.1
0.2.1
0.1.2
0.1.1
Down Chevron
Install
install.packages('igraph')
Monthly Downloads
216,005
Version
1.2.4.1
License
GPL (>= 2)
Maintainer
Gabor Csardi
Last Published
April 22nd, 2019
Functions in igraph (1.2.4.1)
Search functions
alpha_centrality
Find Bonacich alpha centrality scores of network positions
are_adjacent
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
centr_degree
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
Compose two graphs as binary relations
curve_multiple
Optimal edge curvature when plotting graphs
decompose
Decompose a graph into components
distance_table
Shortest (directed or undirected) paths between vertices
diverging_pal
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
graph_
Convert object to a graph
graph_attr<-
Set all or some graph attributes
graph_from_literal
Creating (small) graphs via a simple interface
graph_id
Get the id of a graph
head_of
Head of the edge(s) in a graph
head_print
Print the only the head of an R object
igraph-dollar
Getting and setting graph attributes, shortcut
igraph-es-attributes
Query or set attributes of the edges in an edge sequence
as.directed
Convert between directed and undirected graphs
as.igraph
Conversion to igraph
automorphisms
Number of automorphisms
laplacian_matrix
Graph Laplacian
E
Edges of a graph
layout.reingold.tilford
Deprecated layout functions
layout_with_dh
The Davidson-Harel layout algorithm
layout_with_drl
The DrL graph layout generator
estimate_betweenness
Vertex and edge betweenness centrality
V
Vertices of a graph
as_adjacency_matrix
Convert a graph to an adjacency matrix
make_chordal_ring
Create an extended chordal ring graph
as_adj_list
Adjacency lists
centr_betw
Centralize a graph according to the betweenness of vertices
canonical_permutation
Canonical permutation of a graph
categorical_pal
Palette for categories
make_clusters
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
constraint
Burt's constraint
contract
Contract several vertices into a single one
centralize
Centralization of a graph
count_subgraph_isomorphisms
Count the isomorphic mappings between a graph and the subgraphs of another graph
cliques
The functions find cliques, ie. complete subgraphs in a graph
make_star
Create a star graph, a tree with n vertices and n - 1 leaves
make_tree
Create tree graphs
count_triangles
Find triangles in graphs
modularity.igraph
Modularity of a community structure of a graph
cocitation
Cocitation coupling
cohesive_blocks
Calculate Cohesive Blocks
edge_attr<-
Set one or more edge attributes
motifs
Graph motifs
edge_attr
Query edge attributes of a graph
graph_from_atlas
Create a graph from the Graph Atlas
consensus_tree
Create a consensus tree from several hierarchical random graph models
console
The igraph console
degree
Degree and degree distribution of the vertices
graph_from_edgelist
Create a graph from an edge list matrix
as_data_frame
Creating igraph graphs from data frames or vice-versa
graph_from_graphdb
Load a graph from the graph database for testing graph isomorphism.
path
Helper function to add or delete edges along a path
permute
Permute the vertices of a graph
hrg_tree
Create an igraph graph from a hierarchical random graph model
hub_score
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_print
Indent a printout
intersection
Intersection of two or more sets
is_directed
Check whether a graph is directed
predict_edges
Predict edges based on a hierarchical random graph model
is_graphical
Is a degree sequence graphical?
knn
Average nearest neighbor degree
layout_as_bipartite
Simple two-row layout for bipartite graphs
keeping_degseq
Graph rewiring while preserving the degree distribution
layout_as_star
Generate coordinates to place the vertices of a graph in a star-shape
dim_select
Dimensionality selection for singular values using profile likelihood.
print.igraph
Print graphs to the terminal
disjoint_union
Disjoint union of graphs
layout_with_fr
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_hrg
Fit a hierarchical random graph model
make_graph
Create an igraph graph from a list of edges, or a notable graph
rev.igraph.es
Reverse the order in an edge sequence
rev.igraph.vs
Reverse the order in a vertex sequence
girth
Girth of a graph
igraph-package
The igraph package
add_edges
Add edges to a graph
as_ids
Convert a vertex or edge sequence to an ordinary vector
sample_correlated_gnp_pair
Sample a pair of correlated G(n,p) random graphs
sample_degseq
Generate random graphs with a given degree sequence
print.nexusDatasetInfo
Query and download from the Nexus network repository
gorder
Order (number of vertices) of a graph
norm_coords
Normalize coordinates for plotting graphs
sample_growing
Growing random graph generation
plot.igraph
Plotting of graphs
identical_graphs
Decide if two graphs are identical
plot.sir
Plotting the results on multiple SIR model runs
igraph-attribute-combination
How igraph functions handle attributes when the graph changes
incident
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
Reciprocity of graphs
incident_edges
Incident edges of multiple vertices in a graph
sample_hierarchical_sbm
Sample the hierarchical stochastic block model
is_dag
Directed acyclic graphs
sample_sphere_volume
Sample vectors uniformly from the volume of a sphere
rep.igraph
Replicate a graph multiple times
as_membership
Declare a numeric vector as a membership vector
layout_nicely
Choose an appropriate graph layout algorithm automatically
is_degseq
Check if a degree sequence is valid for a multi-graph
sample_traits_callaway
Graph generation based on different vertex types
scg_group
SCG Problem Solver
layout_on_grid
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
scg_semi_proj
Semi-Projectors
simplified
Constructor modifier to drop multiple and loop edges
centr_eigen
Centralize a graph according to the eigenvector centrality of vertices
scan_stat
Scan statistics on a time series of graphs
make_de_bruijn_graph
De Bruijn graphs
scg-method
Spectral Coarse Graining
simplify
Simple graphs
union
Union of two or more sets
union.igraph
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
vertex_attr
Query vertex attributes of a graph
make_empty_graph
A graph with no edges
stochastic_matrix
Stochastic matrix of a graph
strength
Strength or weighted vertex degree
topo_sort
Topological sorting of vertices in a graph
vertex_attr_names
List names of vertex attributes
write_graph
Writing the graph to a file in some format
transitivity
Transitivity of a graph
count_motifs
Graph motifs
delete_graph_attr
Delete a graph attribute
delete_edges
Delete edges from a graph
match_vertices
Match Graphs given a seeding of vertex correspondences
is_matching
Graph matching
Pie charts as vertices
Using pie charts as vertices in graph plots
vertex_attr<-
Set one or more vertex attributes
difference
Difference of two sets
which_mutual
Find mutual edges in a directed graph
difference.igraph
Difference of graphs
eccentricity
Eccentricity of the vertices in a graph
edge
Helper function for adding and deleting edges
mst
Minimum spanning tree
neighbors
Neighboring (adjacent) vertices in a graph
with_edge_
Constructor modifier to add edge attributes
edge_density
Graph density
normalize
Normalize layout
ego_size
Neighborhood of graph vertices
graph_attr
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
page_rank
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
igraph_demo
Run igraph demos, step by step
print.igraphHRGConsensus
Print a hierarchical random graph consensus tree to the screen
r_pal
The default R palette
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
igraph_options
Parameters for the igraph package
sample_k_regular
Create a random regular graph
sample_last_cit
Random citation graphs
igraph_test
Run package tests
igraph_version
Query igraph's version string
is_named
Named graphs
sample_pa_age
Generate an evolving random graph with preferential attachment and aging
sample_pref
Trait-based random generation
spectrum
Eigenvalues and eigenvectors of the adjacency matrix of a graph
time_bins.sir
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.
which_multiple
Find the multiple or loop edges in a graph
layout.spring
Spring layout, this was removed from igraph
layout_on_sphere
Graph layout with vertices on the surface of a sphere
without_loops
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
layout_with_kk
The Kamada-Kawai layout algorithm
make_full_bipartite_graph
Create a full bipartite graph
add_layout_
Add layout to graph
add_vertices
Add vertices to a graph
make_full_citation_graph
Create a complete (full) citation graph
assortativity
Assortativity coefficient
make_ring
Create a ring graph
make_line_graph
Line graph of a graph
min_separators
Minimum size vertex separators
authority_score
Kleinberg's authority centrality scores.
c.igraph.es
Concatenate edge sequences
c.igraph.vs
Concatenate vertex sequences
%>%
Magrittr's pipes
min_st_separators
Minimum size vertex separators
Drawing graphs
Drawing graphs
complementer
Complementer of a graph
printer_callback
Create a printer callback function
component_wise
Component-wise layout
printr
Better printing of R packages
convex_hull
Convex hull of a set of vertices
running_mean
Running mean of a time series
sample_
Sample from a random graph model
coreness
K-core decomposition of graphs
sample_gnp
Generate random graphs according to the G(n,p) Erdos-Renyi model
delete_vertex_attr
Delete a vertex attribute
sample_grg
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
dfs
Depth-first search
sequential_pal
Sequential palette
diameter
Diameter of a graph
set_edge_attr
Set edge attributes
shapes
Various vertex shapes when plotting igraph graphs
diversity
Graph diversity
dominator_tree
Dominator tree
embed_laplacian_matrix
Spectral Embedding of the Laplacian of a Graph
similarity
Similarity measures of two vertices
adjacent_vertices
Adjacent vertices of multiple vertices in a graph
ends
Incident vertices of some graph edges
all_simple_paths
List all simple paths from one source
graph_version
Igraph data structure versions
subcomponent
In- or out- component of a vertex
subgraph
Subgraph of a graph
graphlet_basis
Graphlet decomposition of a graph
triad_census
Triad census, subgraphs with three vertices
igraph-minus
Delete vertices or edges from a graph
hrg
Create a hierarchical random graph from an igraph graph
igraph-vs-attributes
Query or set attributes of the vertices in a vertex sequence
hrg-methods
Hierarchical random graphs
is_separator
Vertex separators
unfold_tree
Convert a general graph into a forest
intersection.igraph
Intersection of graphs
intersection.igraph.es
Intersection of edge sequences
as_edgelist
Convert a graph to an edge list
isomorphisms
Calculate all isomorphic mappings between the vertices of two graphs
layout.svd
SVD layout, this was removed from igraph
is_weighted
Weighted graphs
as_graphnel
Convert igraph graphs to graphNEL objects from the graph package
ivs
Independent vertex sets
bfs
Breadth-first search
layout_
Graph layouts
biconnected_components
Biconnected components
layout_with_lgl
Large Graph Layout
layout_with_mds
Graph layout by multidimensional scaling
centr_clo
Centralize a graph according to the closeness of vertices
max_cardinality
Maximum cardinality search
centr_clo_tmax
Theoretical maximum for closeness centralization
max_flow
Maximum flow in a graph
closeness
Closeness centrality of vertices
merge_coords
Merging graph layouts
membership
Functions to deal with the result of network community detection
cluster_edge_betweenness
Community structure detection based on edge betweenness
compare
Compares community structures using various metrics
min_cut
Minimum cut in a graph
difference.igraph.es
Difference of edge sequences
plot_dendrogram
Community structure dendrogram plots
plot_dendrogram.igraphHRG
HRG dendrogram plot
+.igraph
Add vertices, edges or another graph to a graph
difference.igraph.vs
Difference of vertex sequences
rewire
Rewiring edges of a graph
power_centrality
Find Bonacich Power Centrality Scores of Network Positions
sample_forestfire
Forest Fire Network Model
rglplot
3D plotting of graphs with OpenGL
dyad_census
Dyad census of a graph
sample_gnm
Generate random graphs according to the G(n,m) Erdos-Renyi model
sample_motifs
Graph motifs
each_edge
Rewires the endpoints of the edges of a graph to a random vertex
fit_power_law
Fitting a power-law distribution function to discrete data
get.edge.ids
Find the edge ids based on the incident vertices of the edges
sample_pa
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
scg
All-in-one Function for the SCG of Matrices and Graphs
graph_from_lcf
Creating a graph from LCF notation
groups
Groups of a vertex partitioning
scg_eps
Error of the spectral coarse graining (SCG) approximation
srand
Deprecated function, used to set random seed of the C library's RNG
split_join_distance
Split-join distance of two community structures
gsize
The size of the graph (number of edges)
[.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
igraph-vs-indexing
Indexing vertex sequences
upgrade_graph
Igraph data structure versions
vertex
Helper function for adding and deleting vertices
igraph-vs-indexing2
Select vertices and show their metadata
intersection.igraph.vs
Intersection of vertex sequences
with_vertex_
Constructor modifier to add vertex attributes
without_attr
Construtor modifier to remove all attributes from a graph
is_chordal
Chordality of a graph
is_igraph
Is this object an igraph graph?
is_min_separator
Minumal vertex separators
isomorphic
Decide if two graphs are isomorphic
isomorphism_class
Isomorphism class of a graph
layout_as_tree
The Reingold-Tilford graph layout algorithm
layout_in_circle
Graph layout with vertices on a circle.
layout_with_sugiyama
The Sugiyama graph layout generator
local_scan
Compute local scan statistics on graphs
make_
Make a new graph
is_bipartite
Create a bipartite graph
make_kautz_graph
Kautz graphs
make_lattice
Create a lattice graph
random_walk
Random walk on a graph
read_graph
Reading foreign file formats
sample_fitness
Random graphs from vertex fitness scores
sample_fitness_pl
Scale-free random graphs, from vertex fitness scores
sample_hrg
Sample from a hierarchical random graph model
sample_islands
A graph with subgraphs that are each a random graph.
sample_sbm
Sample stochastic block model
sample_seq
Sampling a random integer sequence
set_graph_attr
Set a graph attribute
set_vertex_attr
Set vertex attributes
st_cuts
List all (s,t)-cuts of a graph
st_min_cuts
List all minimum \((s,t)\)-cuts of 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
unique.igraph.es
Remove duplicate edges from an edge sequence
unique.igraph.vs
Remove duplicate vertices from a vertex sequence
with_graph_
Constructor modifier to add graph attributes
with_igraph_opt
Run code with a temporary igraph options setting