2. Games: Randomized Graph Generators

2.1. igraph_grg_game — Generating geometric random graphs.
2.2. igraph_barabasi_game — Generates a graph based on the Barabási-Albert model.
2.3. igraph_nonlinear_barabasi_game — Generates graph with non-linear preferential attachment
2.4. igraph_erdos_renyi_game — Generates a random (Erdos-Renyi) graph.
2.5. igraph_watts_strogatz_game — The Watts-Strogatz small-world model
2.6. igraph_rewire_edges — Rewire the edges of a graph with constant probability
2.7. igraph_degree_sequence_game — Generates a random graph with a given degree sequence
2.8. igraph_forest_fire_game — Generates a network according to the “forest fire game”
2.9. igraph_rewire — Randomly rewires a graph while preserving the degree distribution.
2.10. igraph_growing_random_game — Generates a growing random graph.
2.11. igraph_callaway_traits_game — Simulate a growing network with vertex types.
2.12. igraph_establishment_game — Generates a graph with a simple growing model with vertex types.
2.13. igraph_preference_game — Generates a graph with vertex types and connection preferences
2.14. igraph_asymmetric_preference_game — Generates a graph with asymmetric vertex types and connection preferences
2.15. igraph_recent_degree_game — Stochastic graph generator based on the number of adjacent edges a node has gained recently
2.16. igraph_barabasi_aging_game — Preferential attachment with aging of vertices
2.17. igraph_recent_degree_aging_game — Preferential attachment based on the number of edges gained recently, with aging of vertices
2.18. igraph_cited_type_game — Simulate a citation based on vertex types.
2.19. 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.