Package index • igraphlite

R Interface

is_igraph(): igraph_ptr: cpp11-powered class for igraph objects
as_igraph() as.data.frame(<igraph_ptr>) as.matrix(<igraph_ptr>): Convert igraph objects to and from other formats.
graph_from_data_frame() graph_from_symbolic_edgelist() graph_from_edgelist(): Convert edge lists to igraph objects.

Basic Interface

https://igraph.org/c/doc/igraph-Basic.html

graph_empty() graph_copy(): Graph constructors
vcount() ecount() is_directed(): Basic query operations
edge() edges() get_eids() get_all_eids_between() neighbors() incident() degree(): Basic query operations to get adjacency
add_edges() add_vertices() delete_edges() delete_vertices(): Adding and deleting vertices and edges
IGRAPH_VCOUNT_MAX IGRAPH_ECOUNT_MAX IGRAPH_UNLIMITED expand_path_to_pairs() is_same_graph(): Miscellaneous macros

Data Structure

https://igraph.org/c/doc/igraph-Data-structures.html

as_adjlist() as_inclist(): Adjacency lists and incidence lists

Random numbers

https://igraph.org/c/doc/igraph-Random.html

igraph_rng_seed(): Seeds a random number generator

Graph Generators

Deterministic Graph Generators

https://igraph.org/c/doc/igraph-Generators.html

graph_create(): Create a graph with the specified edges
graph_star(): Create a star graph
graph_hypercube(): Create an n-dimensional hypercube graph
graph_square_lattice() graph_triangular_lattice() graph_hexagonal_lattice() graph_ring() graph_path(): Create arbitrary dimensional lattices
graph_lcf() graph_circulant(): Creates a graph from LCF notation
graph_kary_tree(): Create a tree graph
graph_full(): Create a full graph (complete graph)
graph_famous(): Create a famous graph by simply providing its name

Stochastic Graph Generators (“games”)

https://igraph.org/c/doc/igraph-Games.html

erdos_renyi_game_gnm() erdos_renyi_game_gnp(): The Erdős-Rényi and related models
degree_sequence_game() k_regular_game() rewire(): Degree-constrained models
watts_strogatz_game() rewire_edges(): Edge rewiring models

Attributes of Graph, Vertices, and Edges

https://igraph.org/c/doc/igraph-Attributes.html

Vattr() `Vattr<-`() Eattr() `Eattr<-`() V() E(): Get and set vertex and edge attributes
Vnames() as_vids() as_vnames(): Conversion between vertex IDs and names
igraph_from() igraph_to(): Quick access to edge list columns

Structural Properties

https://igraph.org/c/doc/igraph-Structural.html

are_adjacent(): Basic Properties
distances() average_path_length() path_length_hist() eccentricity() diameter() girth() radius(): Distance-related Functions
get_shortest_paths() get_all_shortest_paths() get_all_simple_paths(): Shortest Path Related Functions
global_efficiency() local_efficiency() average_local_efficiency(): Efficiency measures
neighborhood_size() neighborhood(): Neighborhood of vertices
subcomponent() connected_components() is_connected() count_reachable() transitive_closure() articulation_points() bridges() is_biconnected() subcomponents(): Graph Components
closeness() harmonic_centrality() betweenness() edge_betweenness() edge_betweenness_subset() pagerank() constraint() maxdegree() strength() eigenvector_centrality() hub_and_authority_scores() convergence_degree(): Centrality measures
is_simple() has_loop() count_loops() has_multiple() count_multiple(): Non-simple graphs: multiple and loop edges

Graph cycles

https://igraph.org/c/doc/igraph-Cycles.html

is_dag() is_acyclic() topological_sorting(): Acyclic graphs and feedback sets
is_eulerian(): Eulerian cycles and paths

Cliques and independent vertex sets

https://igraph.org/c/doc/igraph-Cliques.html

is_complete() is_clique() cliques() clique_size_hist() largest_cliques() maximal_cliques() maximal_cliques_count() maximal_cliques_hist() clique_number(): Cliques
is_independent_vertex_set() independent_vertex_sets() largest_independent_vertex_sets() maximal_independent_vertex_sets() independence_number(): Independent vertex sets

Graph isomorphism

https://igraph.org/c/doc/igraph-Isomorphism.html

isomorphic() subisomorphic(): The simple interface for graph isomorphism
canonical_permutation() permutate_vertices(): Permute the vertices

Generating Layouts for Graph Drawing

https://igraph.org/c/doc/igraph-Layout.html

layout_random() layout_circle() layout_star() layout_grid() layout_drl() layout_fruchterman_reingold() layout_mds(): 2D layout generators
layout_reingold_tilford() layout_reingold_tilford_circular(): Layouts for trees and acyclic graphs
layout_nicely(): Choose a layout algorithm automatically
augment(<igraph_ptr>) plot(<igraph_ptr>): Methods for quick visualization

Miscellaneous operators

https://igraph.org/c/doc/igraph-Operators.html

induced_subgraph() induced_subgraph_edges() subgraph_from_edges(): Miscellaneous operators

https://igraph.org/c/doc/igraph-Nongraph.html

igraph_version(): Get the version of the igraph C library
common_params(): Common parameters used throughout the package

Reading and writing graphs from and to files

https://igraph.org/c/doc/igraph-Foreign.html

read_graph() read_graph_edgelist() read_graph_ncol() read_graph_lgl() read_graph_graphml() read_graph_gml() read_graph_pajek() read_graph_dl(): Read graphs from files
write_graph() write_graph_edgelist() write_graph_ncol() write_graph_lgl() write_graph_graphml() write_graph_gml() write_graph_pajek() write_graph_dot() write_graph_leda(): Write graphs to files

Other Packages

as_igraph(<phylo>) as_phylo(): Conversion between phylo and igraph
as_igraph(<tbl_tree>) as_tbl_tree(): Conversion between tbl_tree and igraph
is_sink() is_source() Vsink() Vsource(): Shortcuts to get sink/source vertices.
find_common_ancestors() upstream_vertices(): Experimental functions