This package is considered a duplicate. The official version of this package is found at:https://igraph.r-universe.dev/igraph

Package: igraph 2.1.1

Kirill Müller

igraph: 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.

Authors:Gábor Csárdi [aut], Tamás Nepusz [aut], Vincent Traag [aut], Szabolcs Horvát [aut], Fabio Zanini [aut], Daniel Noom [aut], Kirill Müller [aut, cre], Maëlle Salmon [ctb], Michael Antonov [ctb], Chan Zuckerberg Initiative [fnd]

igraph_2.1.1.tar.gz
igraph_2.1.1.tar.gz(r-4.5-noble)igraph_2.1.1.tar.gz(r-4.4-noble)
igraph.pdf |igraph.html✨
igraph/json (API)
NEWS

# Install 'igraph' in R:

install.packages('igraph', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/igraph/rigraph/issues

Uses libs:

libxml2– GNOME XML library
glpk– Linear programming kit with integer (MIP) support
openblas– Optimized BLAS
c++– GNU Standard C++ Library v3

14.52 score 2 stars 1.9k packages 29k scripts 502k downloads 1.6k mentions 817 exports 10 dependencies

Last updated 1 months agofrom:caeafaf6af. Checks:OK: 1 NOTE: 1. Indexed: no.

Target	Result	Date
Doc / Vignettes	OK	Nov 20 2024
R-4.5-linux-x86_64	NOTE	Nov 20 2024

Exports:.data .env .from .inc .innei .nei .outnei .to %--%%->%%<-%%>%%c%%du%%m%%s%%u%add_edges add_layout_add_shape add_vertices add.edges add.vertex.shape add.vertices adhesion adjacent_vertices adjacent.triangles aging.ba.game aging.barabasi.game aging.prefatt.game algorithm all_shortest_paths all_simple_paths alpha_centrality alpha.centrality any_loop any_multiple are_adjacent are.connected arpack arpack_defaults articulation_points articulation.points as_adj as_adj_edge_list as_adj_list as_adjacency_matrix as_biadjacency_matrix as_bipartite as_data_frame as_directed as_edgelist as_graphnel as_ids as_incidence_matrix as_long_data_frame as_membership as_phylo as_star as_tree as_undirected as.directed as.igraph as.undirected assortativity assortativity_degree assortativity_nominal assortativity.degree assortativity.nominal asym_pref asymmetric.preference.game atlas authority_score authority.score autocurve.edges automorphism_group automorphisms average_local_efficiency average.path.length ba.game barabasi.game betweenness betweenness.estimate bfs bibcoupling biconnected_components biconnected.components bipartite bipartite_graph bipartite_mapping bipartite_projection bipartite_projection_size bipartite.mapping bipartite.projection bipartite.projection.size bipartite.random.game blockGraphs blocks bonpow bridges callaway.traits.game canonical_permutation canonical.permutation categorical_pal centr_betw centr_betw_tmax centr_clo centr_clo_tmax centr_degree centr_degree_tmax centr_eigen centr_eigen_tmax centralization.betweenness centralization.betweenness.tmax centralization.closeness centralization.closeness.tmax centralization.degree centralization.degree.tmax centralization.evcent centralization.evcent.tmax centralize centralize.scores chordal_ring chung_lu cit_cit_types cit_types cited.type.game citing.cited.type.game clique_num clique_size_counts clique.number cliques closeness closeness.estimate cluster_edge_betweenness cluster_fast_greedy cluster_fluid_communities cluster_infomap cluster_label_prop cluster_leading_eigen cluster_leiden cluster_louvain cluster_optimal cluster_spinglass cluster_walktrap cluster.distribution clusters cocitation code_len code.length cohesion cohesive_blocks cohesive.blocks communities compare complementer component_distribution component_wise components compose connect connect.neighborhood consensus_tree console constraint contract contract.vertices convex_hull convex.hull coreness count_automorphisms count_components count_isomorphisms count_max_cliques count_motifs count_multiple count_subgraph_isomorphisms count_triangles count.multiple create.communities crossing curve_multiple cut_at cutat de_bruijn_graph decompose decompose.graph degree degree_distribution degree.distribution degree.sequence.game degseq delete_edge_attr delete_edges delete_graph_attr delete_vertex_attr delete_vertices delete.edges delete.vertices dendPlot dfs diameter difference dim_select directed_graph disjoint_union distance_table distances diverging_pal diversity dominator_tree dominator.tree dot_product drl_defaults dyad_census dyad.census E E<-each_edge eccentricity ecount edge edge_attr edge_attr_names edge_attr<-edge_betweenness edge_connectivity edge_density edge_disjoint_paths edge.attributes edge.attributes<-edge.betweenness edge.betweenness.community edge.betweenness.estimate edge.connectivity edge.disjoint.paths edges ego ego_size eigen_centrality embed_adjacency_matrix embed_laplacian_matrix empty_graph ends erdos.renyi.game establishment.game estimate_betweenness estimate_closeness estimate_edge_betweenness eulerian_cycle eulerian_path evcent export_pajek exportPajek farthest_vertices farthest.nodes fastgreedy.community feedback_arc_set fit_hrg fit_power_law forest.fire.game from_adjacency from_data_frame from_edgelist from_incidence_matrix from_literal from_prufer full_bipartite_graph full_citation_graph full_graph get_diameter get_edge_ids get.adjacency get.adjedgelist get.adjlist get.all.shortest.paths get.data.frame get.diameter get.edge get.edge.attribute get.edge.ids get.edgelist get.edges get.graph.attribute get.incidence get.shortest.paths get.stochastic get.vertex.attribute getIgraphOpt girth global_efficiency gnm gnp gorder graph graph_graph_attr graph_attr_names graph_attr<-graph_center graph_from_adj_list graph_from_adjacency_matrix graph_from_atlas graph_from_biadjacency_matrix graph_from_data_frame graph_from_edgelist graph_from_graphdb graph_from_graphnel graph_from_incidence_matrix graph_from_isomorphism_class graph_from_lcf graph_from_literal graph_id graph_version graph.adhesion graph.adjacency graph.adjlist graph.atlas graph.attributes graph.attributes<-graph.automorphisms graph.bfs graph.bipartite graph.cohesion graph.complementer graph.compose graph.coreness graph.count.isomorphisms.vf2 graph.count.subisomorphisms.vf2 graph.data.frame graph.de.bruijn graph.density graph.dfs graph.difference graph.disjoint.union graph.diversity graph.edgelist graph.eigen graph.empty graph.extended.chordal.ring graph.famous graph.formula graph.full graph.full.bipartite graph.full.citation graph.get.isomorphisms.vf2 graph.get.subisomorphisms.vf2 graph.graphdb graph.incidence graph.intersection graph.isoclass graph.isoclass.subgraph graph.isocreate graph.isomorphic graph.isomorphic.bliss graph.isomorphic.vf2 graph.kautz graph.knn graph.laplacian graph.lattice graph.lcf graph.maxflow graph.mincut graph.motifs graph.motifs.est graph.motifs.no graph.neighborhood graph.ring graph.star graph.strength graph.subisomorphic.lad graph.subisomorphic.vf2 graph.tree graph.union graphlet_basis graphlet_proj graphlets graphlets.candidate.basis graphlets.project graphs_from_cohesive_blocks greedy_vertex_coloring grg grg.game groups growing growing.random.game gsize harmonic_centrality has_eulerian_cycle has_eulerian_path has.multiple head_of head_print hierarchical_sbm hierarchy hits_scores hrg hrg_tree hrg.consensus hrg.create hrg.dendrogram hrg.fit hrg.game hrg.predict hub_score hub.score identical_graphs igraph_demo igraph_opt igraph_options igraph_version igraph.console igraph.drl.coarsen igraph.drl.coarsest igraph.drl.default igraph.drl.final igraph.drl.refine igraph.from.graphNEL igraph.options igraph.sample igraph.shape.noclip igraph.shape.noplot igraph.to.graphNEL igraph.version igraphdemo in_circle incident incident_edges indent_print independence_number independence.number independent.vertex.sets induced_subgraph induced.subgraph infomap.community interconnected.islands.game intersection is_acyclic is_biconnected is_bipartite is_chordal is_connected is_dag is_degseq is_directed is_forest is_graphical is_hierarchical is_igraph is_isomorphic_to is_matching is_max_matching is_min_separator is_named is_printer_callback is_separator is_simple is_subgraph_isomorphic_to is_tree is_weighted is.bipartite is.chordal is.connected is.dag is.degree.sequence is.directed is.graphical.degree.sequence is.hierarchical is.igraph is.loop is.matching is.maximal.matching is.minimal.separator is.multiple is.mutual is.named is.separator is.simple is.weighted isomorphic isomorphism_class isomorphisms ivs ivs_size k_shortest_paths k.regular.game kautz_graph keeping_degseq knn label.propagation.community laplacian_matrix largest_cliques largest_component largest_ivs largest_weighted_cliques largest.cliques largest.independent.vertex.sets last_cit lastcit.game lattice layout_layout_as_bipartite layout_as_star layout_as_tree layout_components layout_in_circle layout_nicely layout_on_grid layout_on_sphere layout_randomly layout_with_dh layout_with_drl layout_with_fr layout_with_gem layout_with_graphopt layout_with_kk layout_with_lgl layout_with_mds layout_with_sugiyama layout.auto layout.bipartite layout.circle layout.davidson.harel layout.drl layout.fruchterman.reingold layout.fruchterman.reingold.grid layout.gem layout.graphopt layout.grid layout.grid.3d layout.kamada.kawai layout.lgl layout.mds layout.merge layout.norm layout.random layout.reingold.tilford layout.sphere layout.spring layout.star layout.sugiyama layout.svd leading.eigenvector.community line_graph line.graph list.edge.attributes list.graph.attributes list.vertex.attributes local_efficiency local_scan make_make_bipartite_graph make_chordal_ring make_clusters make_de_bruijn_graph make_directed_graph make_ego_graph make_empty_graph make_from_prufer make_full_bipartite_graph make_full_citation_graph make_full_graph make_graph make_kautz_graph make_lattice make_line_graph make_neighborhood_graph make_ring make_star make_tree make_undirected_graph match_vertices max_bipartite_match max_cardinality max_cliques max_cohesion max_degree max_flow max_ivs maxcohesion maximal_ivs maximal.cliques maximal.cliques.count maximal.independent.vertex.sets maximum.bipartite.matching maximum.cardinality.search mean_distance membership merge_coords merges min_cut min_separators min_st_separators minimal.st.separators minimum.size.separators minimum.spanning.tree mod.matrix modularity modularity_matrix motifs mst multilevel.community neighborhood neighborhood_size neighborhood.size neighbors nicely no.clusters norm_coords normalize on_grid on_sphere optimal.community pa pa_age page_rank page.rank parent path path.length.hist permute permute.vertices piecewise.layout plot_dendrogram plot_hierarchy plot.igraph plotHierarchy power_centrality power.law.fit predict_edges pref preference.game print_all print.igraph printer_callback r_pal radius random_edge_walk random_walk random.graph.game randomly read_graph read.graph realize_bipartite_degseq realize_degseq reciprocity remove.edge.attribute remove.graph.attribute remove.vertex.attribute reverse_edges rewire rglplot ring running_mean running.mean sample_sample_asym_pref sample_bipartite sample_chung_lu sample_cit_cit_types sample_cit_types sample_correlated_gnp sample_correlated_gnp_pair sample_degseq sample_dirichlet sample_dot_product sample_fitness sample_fitness_pl sample_forestfire sample_gnm sample_gnp sample_grg sample_growing sample_hierarchical_sbm sample_hrg sample_islands sample_k_regular sample_last_cit sample_motifs sample_pa sample_pa_age sample_pref sample_sbm sample_seq sample_smallworld sample_spanning_tree sample_sphere_surface sample_sphere_volume sample_traits sample_traits_callaway sample_tree sbm sbm.game scan_stat sequential_pal set_edge_attr set_graph_attr set_vertex_attr set.edge.attribute set.graph.attribute set.vertex.attribute shape_noclip shape_noplot shapes shortest_paths shortest.paths show_trace showtrace similarity similarity.dice similarity.invlogweighted similarity.jaccard simplified simplify simplify_and_colorize sir sizes smallworld spectrum spinglass.community split_join_distance st_cuts st_min_cuts star static.fitness.game static.power.law.game stCuts stMincuts stochastic_matrix strength subcomponent subgraph subgraph_centrality subgraph_from_edges subgraph_isomorphic subgraph_isomorphisms subgraph.centrality subgraph.edges tail_of time_bins tk_canvas tk_center tk_close tk_coords tk_fit tk_off tk_postscript tk_reshape tk_rotate tk_set_coords tkplot tkplot.canvas tkplot.center tkplot.close tkplot.export.postscript tkplot.fit.to.screen tkplot.getcoords tkplot.off tkplot.reshape tkplot.rotate tkplot.setcoords to_prufer topo_sort topological.sort traits traits_callaway transitivity tree triad_census triad.census triangles undirected_graph unfold_tree unfold.tree union upgrade_graph V V<-vcount vertex vertex_attr vertex_attr_names vertex_attr<-vertex_connectivity vertex_disjoint_paths vertex.attributes vertex.attributes<-vertex.connectivity vertex.disjoint.paths vertex.shapes vertices voronoi_cells walktrap.community watts.strogatz.game weighted_clique_num weighted_cliques which_loop which_multiple which_mutual with_dh with_drl with_edge_with_fr with_gem with_graph_with_graphopt with_igraph_opt with_kk with_lgl with_mds with_sugiyama with_vertex_without_attr without_loops without_multiples write_graph write.graph

Dependencies:cli cpp11 glue lattice lifecycle magrittr Matrix pkgconfig rlang vctrs

igraph (interfaz R)

Rendered fromigraph_ES.rmdusingknitr::rmarkdownon Nov 20 2024.

Last update: 2024-10-19
Started: 2023-04-07

igraph (R interface)

Rendered fromigraph.Rmdusingknitr::rmarkdownon Nov 20 2024.

Last update: 2024-10-19
Started: 2023-02-10

Citation

Readme and manuals

Help Manual

Help page	Topics
Query and manipulate a graph as it were an adjacency matrix	[.igraph
Query and manipulate a graph as it were an adjacency list	[[.igraph
Magrittr's pipes	%>%
Add vertices, edges or another graph to a graph	+.igraph
Add edges to a graph	add_edges
Add layout to graph	add_layout_
Add vertices to a graph	add_vertices
Adjacent vertices of multiple vertices in a graph	adjacent_vertices
List all simple paths from one source	all_simple_paths
Find Bonacich alpha centrality scores of network positions	alpha_centrality
Are two vertices adjacent?	are_adjacent
ARPACK eigenvector calculation	arpack arpack-options arpack.unpack.complex arpack_defaults
Articulation points and bridges of a graph	articulation_points bridges
Adjacency lists	as_adj_edge_list as_adj_list
Convert a graph to an adjacency matrix	as_adjacency_matrix
Bipartite adjacency matrix of a bipartite graph	as_biadjacency_matrix
Creating igraph graphs from data frames or vice-versa	as_data_frame from_data_frame graph_from_data_frame
Convert between directed and undirected graphs	as_directed as_undirected
Convert a graph to an edge list	as_edgelist
Convert igraph graphs to graphNEL objects from the graph package	as_graphnel
Convert a vertex or edge sequence to an ordinary vector	as_ids as_ids.igraph.es as_ids.igraph.vs
Convert a graph to a long data frame	as_long_data_frame
Declare a numeric vector as a membership vector	as_membership
Conversion to igraph	as.igraph as.igraph.igraphHRG
Convert igraph objects to adjacency or edge list matrices	as.matrix.igraph
Assortativity coefficient	assortativity assortativity_degree assortativity_nominal
Kleinberg's authority centrality scores.	authority_score hub_score
Generating set of the automorphism group of a graph	automorphism_group
Vertex and edge betweenness centrality	betweenness betweenness.estimate edge.betweenness.estimate edge_betweenness
Breadth-first search	bfs
Biconnected components	biconnected_components
Decide whether a graph is bipartite	bipartite_mapping
Project a bipartite graph	bipartite_projection bipartite_projection_size
Concatenate edge sequences	c.igraph.es
Concatenate vertex sequences	c.igraph.vs
Canonical permutation of a graph	canonical_permutation
Palette for categories	categorical_pal
Centralize a graph according to the betweenness of vertices	centr_betw
Theoretical maximum for betweenness centralization	centr_betw_tmax
Centralize a graph according to the closeness of vertices	centr_clo
Theoretical maximum for closeness centralization	centr_clo_tmax
Centralize a graph according to the degrees of vertices	centr_degree
Theoretical maximum for degree centralization	centr_degree_tmax
Centralize a graph according to the eigenvector centrality of vertices	centr_eigen
Theoretical maximum for eigenvector centralization	centr_eigen_tmax
Centralization of a graph	centralization centralize
Functions to find cliques, i.e. complete subgraphs in a graph	cliques clique_num clique_size_counts count_max_cliques largest_cliques largest_weighted_cliques max_cliques weighted_clique_num
Closeness centrality of vertices	closeness closeness.estimate
Community structure detection based on edge betweenness	cluster_edge_betweenness
Community structure via greedy optimization of modularity	cluster_fast_greedy
Community detection algorithm based on interacting fluids	cluster_fluid_communities
Infomap community finding	cluster_infomap
Finding communities based on propagating labels	cluster_label_prop
Community structure detecting based on the leading eigenvector of the community matrix	cluster_leading_eigen
Finding community structure of a graph using the Leiden algorithm of Traag, van Eck & Waltman.	cluster_leiden
Finding community structure by multi-level optimization of modularity	cluster_louvain
Optimal community structure	cluster_optimal
Finding communities in graphs based on statistical meachanics	cluster_spinglass
Community structure via short random walks	cluster_walktrap
Cocitation coupling	bibcoupling cocitation
Calculate Cohesive Blocks	blocks cohesion.cohesiveBlocks cohesiveBlocks cohesive_blocks export_pajek graphs_from_cohesive_blocks hierarchy length.cohesiveBlocks max_cohesion parent plot.cohesiveBlocks plot_hierarchy print.cohesiveBlocks summary.cohesiveBlocks
Compares community structures using various metrics	compare compare.communities compare.membership
Complementer of a graph	complementer
Connected components of a graph	components component_distribution count_components is_connected largest_component
Component-wise layout	component_wise
Compose two graphs as binary relations	%c% compose
Neighborhood of graph vertices	connect ego ego_graph ego_size make_ego_graph make_neighborhood_graph neighborhood neighborhood_size
Create a consensus tree from several hierarchical random graph models	consensus_tree
The igraph console	console
Burt's constraint	constraint
Contract several vertices into a single one	contract
Convex hull of a set of vertices	convex_hull
K-core decomposition of graphs	coreness
Number of automorphisms	count_automorphisms
Count the number of isomorphic mappings between two graphs	count_isomorphisms graph.count.isomorphisms.vf2
Graph motifs	count_motifs
Count the isomorphic mappings between a graph and the subgraphs of another graph	count_subgraph_isomorphisms graph.count.subisomorphisms.vf2
Optimal edge curvature when plotting graphs	curve_multiple
Decompose a graph into components	decompose
Degree and degree distribution of the vertices	degree degree_distribution max_degree
Delete an edge attribute	delete_edge_attr
Delete edges from a graph	delete_edges
Delete a graph attribute	delete_graph_attr
Delete a vertex attribute	delete_vertex_attr
Delete vertices from a graph	delete_vertices
Depth-first search	dfs
Diameter of a graph	diameter farthest_vertices get_diameter
Difference of two sets	difference
Difference of graphs	%m% difference.igraph
Difference of edge sequences	difference.igraph.es
Difference of vertex sequences	difference.igraph.vs
Dimensionality selection for singular values using profile likelihood.	dim_select
Disjoint union of graphs	%du% disjoint_union
Shortest (directed or undirected) paths between vertices	all_shortest_paths distances distance_table mean_distance shortest_paths
Diverging palette	diverging_pal
Graph diversity	diversity
Dominator tree	dominator_tree
'.data' and '.env' pronouns	.data .env dot-data dot-env
Drawing graphs	igraph.plotting
Dyad census of a graph	dyad_census
Edges of a graph	E
Rewires the endpoints of the edges of a graph to a random vertex	each_edge
Eccentricity of the vertices in a graph	eccentricity
Helper function for adding and deleting edges	edge edges
Query edge attributes of a graph	edge.attributes edge_attr
List names of edge attributes	edge_attr_names
Set one or more edge attributes	edge.attributes<- edge_attr<-
Edge connectivity	adhesion edge_connectivity edge_disjoint_paths
Graph density	edge_density
Eigenvector centrality of vertices	eigen_centrality
Spectral Embedding of Adjacency Matrices	embed_adjacency_matrix
Spectral Embedding of the Laplacian of a Graph	embed_laplacian_matrix
Incident vertices of some graph edges	ends get.edges
Finding a feedback arc set in a graph	feedback_arc_set
Fit a hierarchical random graph model	fit_hrg
Fitting a power-law distribution function to discrete data	fit_power_law
Find the edge ids based on the incident vertices of the edges	get_edge_ids
Girth of a graph	girth
Efficiency of a graph	average_local_efficiency global_efficiency local_efficiency
Order (number of vertices) of a graph	gorder vcount
Convert object to a graph	graph_
Graph attributes of a graph	graph.attributes graph_attr
List names of graph attributes	attributes graph_attr_names
Set all or some graph attributes	graph.attributes<- graph_attr<-
Central vertices of a graph	graph_center
Create graphs from adjacency lists	graph_from_adj_list
Create graphs from adjacency matrices	from_adjacency graph_from_adjacency_matrix
Create a graph from the Graph Atlas	atlas graph_from_atlas
Create graphs from a bipartite adjacency matrix	graph_from_biadjacency_matrix
Create a graph from an edge list matrix	from_edgelist graph_from_edgelist
Load a graph from the graph database for testing graph isomorphism.	graph_from_graphdb
Convert graphNEL objects from the graph package to igraph	graph_from_graphnel
Create a graph from an isomorphism class	graph_from_isomorphism_class
Creating a graph from LCF notation	graph_from_lcf
Creating (small) graphs via a simple interface	from_literal graph_from_literal
Get the id of a graph	graph_id
igraph data structure versions	graph_version
Graphlet decomposition of a graph	graphlets graphlet_basis graphlet_proj
Greedy vertex coloring	greedy_vertex_coloring
Groups of a vertex partitioning	groups groups.communities groups.default
The size of the graph (number of edges)	ecount gsize
Harmonic centrality of vertices	harmonic_centrality
Find Eulerian paths or cycles in a graph	eulerian_cycle eulerian_path has_eulerian_cycle has_eulerian_path
Head of the edge(s) in a graph	head_of
Print the only the head of an R object	head_print
Kleinberg's hub and authority centrality scores.	hits_scores
Create a hierarchical random graph from an igraph graph	hrg
Create an igraph graph from a hierarchical random graph model	hrg_tree
Hierarchical random graphs	hrg-methods
Decide if two graphs are identical	identical_graphs
Run igraph demos, step by step	igraph_demo
Parameters for the igraph package	igraph_opt igraph_options
How igraph functions handle attributes when the graph changes	attribute.combination igraph-attribute-combination
Getting and setting graph attributes, shortcut	$.igraph $<-.igraph igraph-dollar
Query or set attributes of the edges in an edge sequence	$.igraph.es $<-.igraph.es E<- igraph-es-attributes [<-.igraph.es [[<-.igraph.es
Indexing edge sequences	%--% %->% %<-% igraph-es-indexing [.igraph.es
Select edges and show their metadata	igraph-es-indexing2 [[.igraph.es
Delete vertices or edges from a graph	-.igraph igraph-minus
Query or set attributes of the vertices in a vertex sequence	$.igraph.vs $<-.igraph.vs igraph-vs-attributes V<- [<-.igraph.vs [[<-.igraph.vs
Indexing vertex sequences	igraph-vs-indexing [.igraph.vs
Select vertices and show their metadata	igraph-vs-indexing2 [[.igraph.vs
Incident edges of a vertex in a graph	incident
Incident edges of multiple vertices in a graph	incident_edges
Indent a printout	indent_print
Intersection of two or more sets	intersection
Intersection of graphs	%s% intersection.igraph
Intersection of edge sequences	intersection.igraph.es
Intersection of vertex sequences	intersection.igraph.vs
Acyclic graphs	is_acyclic
Check biconnectedness	is_biconnected
Checks whether the graph has a vertex attribute called 'type'.	is_bipartite
Chordality of a graph	is_chordal
Directed acyclic graphs	is_dag
Check if a degree sequence is valid for a multi-graph	is_degseq
Check whether a graph is directed	is_directed
Decide whether a graph is a forest.	is_forest
Is a degree sequence graphical?	is_graphical
Is this object an igraph graph?	is_igraph
Matching	is_matching is_max_matching max_bipartite_match
Minimal vertex separators	is_min_separator
Named graphs	is_named
Is this a printer callback?	is_printer_callback
Check whether removing this set of vertices would disconnect the graph.	is_separator
Decide whether a graph is a tree.	is_tree
Weighted graphs	is_weighted
Decide if two graphs are isomorphic	graph.isomorphic graph.isomorphic.34 graph.isomorphic.bliss graph.isomorphic.vf2 isomorphic is_isomorphic_to
Isomorphism class of a graph	graph.isoclass graph.isoclass.subgraph isomorphism_class
Calculate all isomorphic mappings between the vertices of two graphs	graph.get.isomorphisms.vf2 isomorphisms
Independent vertex sets	independence_number ivs ivs_size largest_ivs max_ivs
Find the k shortest paths between two vertices	k_shortest_paths
Graph rewiring while preserving the degree distribution	keeping_degseq
Average nearest neighbor degree	knn
Graph Laplacian	laplacian_matrix
Graph layouts	layout layout_ print.igraph_layout_modifier print.igraph_layout_spec
Simple two-row layout for bipartite graphs	as_bipartite layout_as_bipartite
Generate coordinates to place the vertices of a graph in a star-shape	as_star layout_as_star
The Reingold-Tilford graph layout algorithm	as_tree layout_as_tree
Graph layout with vertices on a circle.	in_circle layout_in_circle
Choose an appropriate graph layout algorithm automatically	layout_nicely nicely
Simple grid layout	layout_on_grid on_grid
Graph layout with vertices on the surface of a sphere	layout_on_sphere on_sphere
Randomly place vertices on a plane or in 3d space	layout_randomly randomly
The Davidson-Harel layout algorithm	layout_with_dh with_dh
The DrL graph layout generator	drl_defaults igraph.drl.coarsen igraph.drl.coarsest igraph.drl.default igraph.drl.final igraph.drl.refine layout_with_drl with_drl
The Fruchterman-Reingold layout algorithm	layout_with_fr with_fr
The GEM layout algorithm	layout_with_gem with_gem
The graphopt layout algorithm	layout_with_graphopt with_graphopt
The Kamada-Kawai layout algorithm	layout_with_kk with_kk
Large Graph Layout	layout_with_lgl with_lgl
Graph layout by multidimensional scaling	layout_with_mds with_mds
The Sugiyama graph layout generator	layout_with_sugiyama with_sugiyama
Compute local scan statistics on graphs	local_scan
Make a new graph	make_
Create a bipartite graph	bipartite_graph make_bipartite_graph
Create an extended chordal ring graph	chordal_ring make_chordal_ring
Creates a communities object.	make_clusters
De Bruijn graphs	de_bruijn_graph make_de_bruijn_graph
A graph with no edges	empty_graph make_empty_graph
Create an undirected tree graph from its Prüfer sequence	from_prufer make_from_prufer
Create a full bipartite graph	full_bipartite_graph make_full_bipartite_graph
Create a complete (full) citation graph	full_citation_graph make_full_citation_graph
Create a full graph	full_graph make_full_graph
Create an igraph graph from a list of edges, or a notable graph	directed_graph make_directed_graph make_graph make_undirected_graph undirected_graph
Kautz graphs	kautz_graph make_kautz_graph
Create a lattice graph	lattice make_lattice
Line graph of a graph	line_graph make_line_graph
Create a ring graph	make_ring ring
Create a star graph, a tree with n vertices and n - 1 leaves	make_star star
Create tree graphs	make_tree tree
Match Graphs given a seeding of vertex correspondences	match_vertices seeded.graph.match
Maximum cardinality search	max_cardinality
Maximum flow in a graph	max_flow
Functions to deal with the result of network community detection	algorithm as.dendrogram.communities as.hclust.communities code_len communities crossing cut_at is_hierarchical length.communities membership merges modularity.communities plot.communities print.communities show_trace sizes
Merging graph layouts	layout_components merge_coords
Minimum cut in a graph	min_cut
Minimum size vertex separators	min_separators
Minimum size vertex separators	min_st_separators
Modularity of a community structure of a graph	modularity modularity.igraph modularity_matrix
Graph motifs	motifs
Minimum spanning tree	mst
Neighboring (adjacent) vertices in a graph	neighbors
Normalize coordinates for plotting graphs	norm_coords
Normalize layout	normalize
The Page Rank algorithm	page_rank
Helper function to add or delete edges along a path	path
Permute the vertices of a graph	permute
Using pie charts as vertices in graph plots	vertex.shape.pie
Community structure dendrogram plots	plot_dendrogram plot_dendrogram.communities
HRG dendrogram plot	plot_dendrogram.igraphHRG
Plotting of graphs	plot.graph plot.igraph
Plotting the results on multiple SIR model runs	plot.sir
Find Bonacich Power Centrality Scores of Network Positions	power_centrality
Predict edges based on a hierarchical random graph model	predict_edges
Print graphs to the terminal	print.igraph print_all str.igraph summary.igraph
Print an edge sequence to the screen	print.igraph.es
Show a vertex sequence on the screen	print.igraph.vs
Print a hierarchical random graph model to the screen	print.igraphHRG
Print a hierarchical random graph consensus tree to the screen	print.igraphHRGConsensus
Create a printer callback function	printer_callback
The default R palette	r_pal
Radius of a graph	radius
Random walk on a graph	random_edge_walk random_walk
Reading foreign file formats	DL GML GraphML LGL Pajek read_graph UCINET
Creating a bipartite graph from two degree sequences, deterministically	realize_bipartite_degseq
Creating a graph from a given degree sequence, deterministically	realize_degseq
Reciprocity of graphs	reciprocity
Replicate a graph multiple times	*.igraph rep.igraph
Reverse the order in an edge sequence	rev.igraph.es
Reverse the order in a vertex sequence	rev.igraph.vs
Reverse edges in a graph	reverse_edges t.igraph
Rewiring edges of a graph	rewire
3D plotting of graphs with OpenGL	rglplot rglplot.igraph
Running mean of a time series	running_mean
Sample from a random graph model	sample_
Bipartite random graphs	bipartite sample_bipartite
Random graph with given expected degrees	chung_lu sample_chung_lu
Generate a new random graph from a given graph by randomly adding/removing edges	sample_correlated_gnp
Sample a pair of correlated G(n,p) random graphs	sample_correlated_gnp_pair
Generate random graphs with a given degree sequence	degseq sample_degseq
Sample from a Dirichlet distribution	sample_dirichlet
Generate random graphs according to the random dot product graph model	dot_product sample_dot_product
Random graphs from vertex fitness scores	sample_fitness
Scale-free random graphs, from vertex fitness scores	sample_fitness_pl
Forest Fire Network Model	sample_forestfire
Generate random graphs according to the G(n,m) Erdős-Rényi model	gnm sample_gnm
Generate random graphs according to the G(n,p) Erdős-Rényi model	gnp sample_gnp
Geometric random graphs	grg sample_grg
Growing random graph generation	growing sample_growing
Sample the hierarchical stochastic block model	hierarchical_sbm sample_hierarchical_sbm
Sample from a hierarchical random graph model	sample_hrg
A graph with subgraphs that are each a random graph.	sample_islands
Create a random regular graph	sample_k_regular
Random citation graphs	cit_cit_types cit_types last_cit sample_cit_cit_types sample_cit_types sample_last_cit
Graph motifs	sample_motifs
Generate random graphs using preferential attachment	pa sample_pa
Generate an evolving random graph with preferential attachment and aging	pa_age sample_pa_age
Trait-based random generation	asym_pref pref sample_asym_pref sample_pref
Sample stochastic block model	sample_sbm sbm
Sampling a random integer sequence	sample_seq
The Watts-Strogatz small-world model	sample_smallworld smallworld
Samples from the spanning trees of a graph randomly and uniformly	sample_spanning_tree
Sample vectors uniformly from the surface of a sphere	sample_sphere_surface
Sample vectors uniformly from the volume of a sphere	sample_sphere_volume
Graph generation based on different vertex types	sample_traits sample_traits_callaway traits traits_callaway
Sample trees randomly and uniformly	sample_tree
Scan statistics on a time series of graphs	scan_stat
Sequential palette	sequential_pal
Set edge attributes	set_edge_attr
Set a graph attribute	set_graph_attr
Set vertex attributes	set_vertex_attr
Various vertex shapes when plotting igraph graphs	add_shape igraph.vertex.shapes shapes shape_noclip shape_noplot
Similarity measures of two vertices	similarity
Constructor modifier to drop multiple and loop edges	simplified
Simple graphs	is_simple simplify simplify_and_colorize
Eigenvalues and eigenvectors of the adjacency matrix of a graph	igraph.eigen.default spectrum
Split-join distance of two community structures	split_join_distance
List all (s,t)-cuts of a graph	st_cuts
List all minimum (s,t)-cuts of a graph	st_min_cuts
Stochastic matrix of a graph	stochastic_matrix
Strength or weighted vertex degree	strength
In- or out- component of a vertex	subcomponent
Subgraph of a graph	induced_subgraph subgraph subgraph_from_edges
Find subgraph centrality scores of network positions	subgraph_centrality
Decide if a graph is subgraph isomorphic to another one	graph.subisomorphic.lad graph.subisomorphic.vf2 is_subgraph_isomorphic_to subgraph_isomorphic
All isomorphic mappings between a graph and subgraphs of another graph	graph.get.subisomorphisms.vf2 subgraph_isomorphisms
Tails of the edge(s) in a graph	tail_of
SIR model on graphs	median.sir quantile.sir sir time_bins time_bins.sir
Interactive plotting of graphs	tkplot tk_canvas tk_center tk_close tk_coords tk_fit tk_off tk_postscript tk_reshape tk_rotate tk_set_coords
Convert a tree graph to its Prüfer sequence	to_prufer
Topological sorting of vertices in a graph	topo_sort
Transitivity of a graph	transitivity
Triad census, subgraphs with three vertices	triad_census
Find triangles in graphs	count_triangles triangles
Convert a general graph into a forest	unfold_tree
Union of two or more sets	union
Union of graphs	%u% union.igraph
Union of edge sequences	union.igraph.es
Union of vertex sequences	union.igraph.vs
Remove duplicate edges from an edge sequence	unique.igraph.es
Remove duplicate vertices from a vertex sequence	unique.igraph.vs
igraph data structure versions	upgrade_graph
Vertices of a graph	V
Helper function for adding and deleting vertices	vertex vertices
Query vertex attributes of a graph	vertex.attributes vertex_attr
List names of vertex attributes	vertex_attr_names
Set one or more vertex attributes	vertex.attributes<- vertex_attr<-
Vertex connectivity	cohesion cohesion.igraph vertex_connectivity vertex_disjoint_paths
Voronoi partitioning of a graph	voronoi_cells
Functions to find weighted cliques, i.e. vertex-weighted complete subgraphs in a graph	weighted_cliques
Find the multiple or loop edges in a graph	any_loop any_multiple count_multiple which_loop which_multiple
Find mutual edges in a directed graph	which_mutual
Constructor modifier to add edge attributes	with_edge_
Constructor modifier to add graph attributes	with_graph_
Run code with a temporary igraph options setting	with_igraph_opt
Constructor modifier to add vertex attributes	with_vertex_
Construtor modifier to remove all attributes from a graph	without_attr
Constructor modifier to drop loop edges	without_loops
Constructor modifier to drop multiple edges	without_multiples
Writing the graph to a file in some format	write_graph