|igraph Reference Manual|
igraph_grg_game— Generating geometric random graphs.
igraph_barabasi_game— Generates a graph based on the Barabási-Albert model.
igraph_nonlinear_barabasi_game— Generates graph with non-linear preferential attachment
igraph_erdos_renyi_game— Generates a random (Erdos-Renyi) graph.
igraph_watts_strogatz_game— The Watts-Strogatz small-world model
igraph_rewire_edges— Rewire the edges of a graph with constant probability
igraph_degree_sequence_game— Generates a random graph with a given degree sequence
igraph_forest_fire_game— Generates a network according to the “forest fire game”
igraph_rewire— Randomly rewires a graph while preserving the degree distribution.
igraph_growing_random_game— Generates a growing random graph.
igraph_callaway_traits_game— Simulate a growing network with vertex types.
igraph_establishment_game— Generates a graph with a simple growing model with vertex types.
igraph_preference_game— Generates a graph with vertex types and connection preferences
igraph_asymmetric_preference_game— Generates a graph with asymmetric vertex types and connection preferences
igraph_recent_degree_game— Stochastic graph generator based on the number of adjacent edges a node has gained recently
igraph_barabasi_aging_game— Preferential attachment with aging of vertices
igraph_recent_degree_aging_game— Preferential attachment based on the number of edges gained recently, with aging of vertices
igraph_cited_type_game— Simulate a citation based on vertex types.
igraph_citing_cited_type_game— Simulate a citation network based on vertex types.
Games are randomized graph generators. Randomization means that they generate a different graph every time you call them.