| igraph::all_simple_paths |
| List all simple paths from one source |
| igraph::alpha_centrality |
| Find Bonacich alpha centrality scores of network positions |
| igraph::arpack_defaults |
| ARPACK eigenvector calculation |
| igraph::articulation_points |
| Articulation points and bridges of a graph |
| igraph::as.directed |
| Convert between directed and undirected graphs |
| igraph::as.igraph |
| Conversion to igraph |
| igraph::as_adj_list |
| Adjacency lists |
| igraph::as_edgelist |
| Convert a graph to an edge list |
| igraph::as_incidence_matrix |
| Incidence matrix of a bipartite graph |
| igraph::assortativity |
| Assortativity coefficient |
| igraph::automorphism_group |
| Generating set of the automorphism group of a graph |
| igraph::automorphisms |
| Number of automorphisms |
| igraph::estimate_betweenness |
| Vertex and edge betweenness centrality |
| igraph::bfs |
| Breadth-first search |
| igraph::biconnected_components |
| Biconnected components |
| igraph::bipartite_mapping |
| Decide whether a graph is bipartite |
| igraph::bipartite_projection |
| Project a bipartite graph |
| igraph::canonical_permutation |
| Canonical permutation of a graph |
| igraph::cliques |
| Functions to find cliques, ie. complete subgraphs in a graph |
| igraph::closeness |
| Closeness centrality of vertices |
| igraph::cluster_edge_betweenness |
| Community structure detection based on edge betweenness |
| igraph::cluster_fast_greedy |
| Community structure via greedy optimization of modularity |
| igraph::cluster_fluid_communities |
| Community detection algorithm based on interacting fluids |
| igraph::cluster_infomap |
| Infomap community finding |
| igraph::cluster_label_prop |
| Finding communities based on propagating labels |
| igraph::cluster_leading_eigen |
| Community structure detecting based on the leading eigenvector of the community matrix |
| igraph::cluster_leiden |
| Finding community structure of a graph using the Leiden algorithm of Traag, van Eck & Waltman. |
| igraph::cluster_louvain |
| Finding community structure by multi-level optimization of modularity |
| igraph::cluster_optimal |
| Optimal community structure |
| igraph::cluster_spinglass |
| Finding communities in graphs based on statistical meachanics |
| igraph::cluster_walktrap |
| Community structure via short random walks |
| igraph::cocitation |
| Cocitation coupling |
| igraph::cohesive_blocks |
| Calculate Cohesive Blocks |
| igraph::membership |
| Functions to deal with the result of network community detection |
| igraph::compare |
| Compares community structures using various metrics |
| igraph::complementer |
| Complementer of a graph |
| igraph::component_distribution |
| Connected components of a graph |
| igraph::compose |
| Compose two graphs as binary relations |
| igraph::console |
| The igraph console |
| igraph::constraint |
| Burt's constraint |
| igraph::contract |
| Contract several vertices into a single one |
| igraph::convex_hull |
| Convex hull of a set of vertices |
| igraph::coreness |
| K-core decomposition of graphs |
| igraph::count_triangles |
| Find triangles in graphs |
| igraph::curve_multiple |
| Optimal edge curvature when plotting graphs |
| igraph::decompose |
| Decompose a graph into components |
| igraph::degree |
| Degree and degree distribution of the vertices |
| igraph::dfs |
| Depth-first search |
| igraph::diameter |
| Diameter of a graph |
| igraph::difference.igraph |
| Difference of graphs |
| igraph::dim_select |
| Dimensionality selection for singular values using profile likelihood. |
| igraph::disjoint_union |
| Disjoint union of graphs |
| igraph::distance_table |
| Shortest (directed or undirected) paths between vertices |
| igraph::diversity |
| Graph diversity |
| igraph::dominator_tree |
| Dominator tree |
| igraph::dyad_census |
| Dyad census of a graph |
| igraph::each_edge |
| Rewires the endpoints of the edges of a graph to a random vertex |
| igraph::edge_connectivity |
| Edge connectivity. |
| igraph::edge_density |
| Graph density |
| igraph::ego_size |
| Neighborhood of graph vertices |
| igraph::eigen_centrality |
| Find Eigenvector Centrality Scores of Network Positions |
| igraph::embed_adjacency_matrix |
| Spectral Embedding of Adjacency Matrices |
| igraph::embed_laplacian_matrix |
| Spectral Embedding of the Laplacian of a Graph |
| igraph::erdos.renyi.game |
| Generate random graphs according to the Erdos-Renyi model |
| igraph::feedback_arc_set |
| Finding a feedback arc set in a graph |
| igraph::fit_power_law |
| Fitting a power-law distribution function to discrete data |
| igraph::girth |
| Girth of a graph |
| igraph::global_efficiency |
| Efficiency of a graph |
| igraph::graph_from_adj_list |
| Create graphs from adjacency lists |
| igraph::graph_from_adjacency_matrix |
| Create graphs from adjacency matrices |
| igraph::as_data_frame |
| Creating igraph graphs from data frames or vice-versa |
| igraph::graph_from_graphdb |
| Load a graph from the graph database for testing graph isomorphism. |
| igraph::graph_from_incidence_matrix |
| Create graphs from an incidence matrix |
| igraph::graph_from_lcf |
| Creating a graph from LCF notation |
| igraph::greedy_vertex_coloring |
| Greedy vertex coloring |
| igraph::harmonic_centrality |
| Harmonic centrality of vertices |
| igraph::has_eulerian_path |
| Find Eulerian paths or cycles in a graph |
| igraph::igraph-attribute-combination |
| How igraph functions handle attributes when the graph changes |
| igraph::igraph_demo |
| Run igraph demos, step by step |
| igraph::igraph_options |
| Parameters for the igraph package |
| igraph::igraph_test |
| Run package tests |
| igraph::igraph_version |
| Query igraph's version string |
| igraph::intersection.igraph |
| Intersection of graphs |
| igraph::is_chordal |
| Chordality of a graph |
| igraph::is_dag |
| Directed acyclic graphs |
| igraph::is_degseq |
| Check if a degree sequence is valid for a multi-graph |
| igraph::is_graphical |
| Is a degree sequence graphical? |
| igraph::is_igraph |
| Is this object an igraph graph? |
| igraph::is_named |
| Named graphs |
| igraph::is_tree |
| Decide whether a graph is a tree. |
| igraph::is_weighted |
| Weighted graphs |
| igraph::ivs |
| Independent vertex sets |
| igraph::keeping_degseq |
| Graph rewiring while preserving the degree distribution |
| igraph::knn |
| Average nearest neighbor degree |
| igraph::laplacian_matrix |
| Graph Laplacian |
| igraph::layout_as_bipartite |
| Simple two-row layout for bipartite graphs |
| igraph::layout_as_star |
| Generate coordinates to place the vertices of a graph in a star-shape |
| igraph::layout_as_tree |
| The Reingold-Tilford graph layout algorithm |
| igraph::layout_in_circle |
| Graph layout with vertices on a circle. |
| igraph::layout_nicely |
| Choose an appropriate graph layout algorithm automatically |
| igraph::layout_on_grid |
| Simple grid layout |
| igraph::layout_on_sphere |
| Graph layout with vertices on the surface of a sphere |
| igraph::layout_randomly |
| Randomly place vertices on a plane or in 3d space |
| igraph::layout_with_drl |
| The DrL graph layout generator |
| igraph::layout_with_fr |
| The Fruchterman-Reingold layout algorithm |
| igraph::layout_with_gem |
| The GEM layout algorithm |
| igraph::layout_with_graphopt |
| The graphopt layout algorithm |
| igraph::layout_with_kk |
| The Kamada-Kawai layout algorithm |
| igraph::layout_with_lgl |
| Large Graph Layout |
| igraph::layout_with_mds |
| Graph layout by multidimensional scaling |
| igraph::layout_with_sugiyama |
| The Sugiyama graph layout generator |
| igraph::is_bipartite |
| Create a bipartite graph |
| igraph::make_de_bruijn_graph |
| De Bruijn graphs |
| igraph::make_from_prufer |
| Create an undirected tree graph from its Prufer sequence |
| igraph::make_full_bipartite_graph |
| Create a full bipartite graph |
| igraph::make_kautz_graph |
| Kautz graphs |
| igraph::make_line_graph |
| Line graph of a graph |
| igraph::match_vertices |
| Match Graphs given a seeding of vertex correspondences |
| igraph::max_cardinality |
| Maximum cardinality search |
| igraph::merge_coords |
| Merging graph layouts |
| igraph::min_st_separators |
| Minimum size vertex separators |
| igraph::modularity.igraph |
| Modularity of a community structure of a graph |
| igraph::mst |
| Minimum spanning tree |
| igraph::norm_coords |
| Normalize coordinates for plotting graphs |
| igraph::page_rank |
| The Page Rank algorithm |
| igraph::permute |
| Permute the vertices of a graph |
| igraph::igraph.plotting |
| Drawing graphs |
| igraph::plot.igraph |
| Plotting of graphs |
| igraph::plot.sir |
| Plotting the results on multiple SIR model runs |
| igraph::plot_dendrogram |
| Community structure dendrogram plots |
| igraph::plot_dendrogram.igraphHRG |
| HRG dendrogram plot |
| igraph::power_centrality |
| Find Bonacich Power Centrality Scores of Network Positions |
| igraph::print.igraph |
| Print graphs to the terminal |
| igraph::read_graph |
| Reading foreign file formats |
| igraph::realize_degseq |
| Creating a graph from a given degree sequence, deterministically |
| igraph::reciprocity |
| Reciprocity of graphs |
| igraph::rglplot |
| 3D plotting of graphs with OpenGL |
| igraph::sample_bipartite |
| Bipartite random graphs |
| igraph::sample_correlated_gnp_pair |
| Sample a pair of correlated G(n,p) random graphs |
| igraph::sample_degseq |
| Generate random graphs with a given degree sequence |
| igraph::sample_dot_product |
| Generate random graphs according to the random dot product graph model |
| igraph::sample_fitness |
| Random graphs from vertex fitness scores |
| igraph::sample_fitness_pl |
| Scale-free random graphs, from vertex fitness scores |
| igraph::sample_forestfire |
| Forest Fire Network Model |
| igraph::sample_gnm |
| Generate random graphs according to the G(n,m) Erdos-Renyi model |
| igraph::sample_gnp |
| Generate random graphs according to the G(n,p) Erdos-Renyi model |
| igraph::sample_grg |
| Geometric random graphs |
| igraph::sample_growing |
| Growing random graph generation |
| igraph::sample_hierarchical_sbm |
| Sample the hierarchical stochastic block model |
| igraph::sample_islands |
| A graph with subgraphs that are each a random graph. |
| igraph::sample_k_regular |
| Create a random regular graph |
| igraph::sample_last_cit |
| Random citation graphs |
| igraph::sample_pa |
| Generate scale-free graphs according to the Barabasi-Albert model |
| igraph::sample_pa_age |
| Generate an evolving random graph with preferential attachment and aging |
| igraph::sample_pref |
| Trait-based random generation |
| igraph::sample_sbm |
| Sample stochastic block model |
| igraph::sample_smallworld |
| The Watts-Strogatz small-world model |
| igraph::sample_traits_callaway |
| Graph generation based on different vertex types |
| igraph::sample_tree |
| Sample trees randomly and uniformly |
| igraph::scg-method |
| Spectral Coarse Graining |
| igraph::scg |
| All-in-one Function for the SCG of Matrices and Graphs |
| igraph::scg_group |
| SCG Problem Solver |
| igraph::similarity |
| Similarity measures of two vertices |
| igraph::simplify |
| Simple graphs |
| igraph::time_bins.sir |
| SIR model on graphs |
| igraph::spectrum |
| Eigenvalues and eigenvectors of the adjacency matrix of a graph |
| igraph::st_cuts |
| List all (s,t)-cuts of a graph |
| igraph::st_min_cuts |
| List all minimum (s,t)-cuts of a graph |
| igraph::stochastic_matrix |
| Stochastic matrix of a graph |
| igraph::strength |
| Strength or weighted vertex degree |
| igraph::subcomponent |
| In- or out- component of a vertex |
| igraph::subgraph |
| Subgraph of a graph |
| igraph::subgraph_centrality |
| Find subgraph centrality scores of network positions |
| igraph::tkigraph |
| Experimental basic igraph GUI |
| igraph::tkplot |
| Interactive plotting of graphs |
| igraph::to_prufer |
| Convert a tree graph to its Prufer sequence |
| igraph::topo_sort |
| Topological sorting of vertices in a graph |
| igraph::transitivity |
| Transitivity of a graph |
| igraph::triad_census |
| Triad census, subgraphs with three vertices |
| igraph::unfold_tree |
| Convert a general graph into a forest |
| igraph::union.igraph |
| Union of graphs |
| igraph::vertex.shape.pie |
| Using pie charts as vertices in graph plots |
| igraph::vertex_connectivity |
| Vertex connectivity. |
| igraph::weighted_cliques |
| Functions to find weighted cliques, ie. weighted complete subgraphs in a graph |
| igraph::which_multiple |
| Find the multiple or loop edges in a graph |
| igraph::which_mutual |
| Find mutual edges in a directed graph |
| igraph::write_graph |
| Writing the graph to a file in some format |
| grDevices::chull |
| Compute Convex Hull of a Set of Points |
![[R logo]](/doc/html/Rlogo.svg)
![[Top]](/doc/html/up.jpg)