[Paper Review] igraph enables fast and robust network analysis across programming languages
igraph provides a fast C core with interfaces in Python, R, and Mathematica for scalable, robust network analysis across languages, now supporting billions of edges and enhanced open science practices.
Networks or graphs are widely used across the sciences to represent relationships of many kinds. igraph (https://igraph.org) is a general-purpose software library for graph construction, analysis, and visualisation, combining fast and robust performance with a low entry barrier. igraph pairs a fast core written in C with beginner-friendly interfaces in Python, R, and Mathematica. Over the last two decades, igraph has expanded substantially. It now scales to billions of edges, supports Mathematica and interactive plotting, integrates with Jupyter notebooks and other network libraries, includes new graph layouts and community detection algorithms, and has streamlined the documentation with examples and Spanish translations. Modern testing features such as continuous integration, address sanitizers, stricter typing, and memory-managed vectors have also increased robustness. Hundreds of bug reports have been fixed and a community forum has been opened to connect users and developers. Specific effort has been made to broaden use and community participation by women, non-binary people, and other demographic groups typically underrepresented in open source software.
Motivation & Objective
- Demonstrate the scalability and robustness of igraph across multiple programming languages.
- Document the growth, features, and performance improvements of igraph over 17 years.
- Highlight accessibility, visualization, and interoperability with other network libraries.
- Describe community, governance, and open science practices surrounding igraph.
Proposed method
- Describe the architecture: a fast C core with language-specific interfaces.
- Showcase scalability to billions of edges and 64-bit integer support.
- List new algorithms and layouts added to the C core and interfaces (e.g., Leiden, multilevel/Louvain, UMAP).
- Explain interoperability features with Python libraries (networkx, graph-tool) and dataframes.
- Detail testing, continuous integration, and documentation improvements.

Experimental results
Research questions
- RQ1How scalable and robust is igraph across languages for large networks?
- RQ2What new algorithms, layouts, and features have been added to igraph recently?
- RQ3How does igraph integrate with other network analysis tools and data ecosystems?
- RQ4What open science and community governance practices accompany igraph?
Key findings
- The C core now supports 64-bit integers enabling analysis of networks with billions of vertices and edges.
- Bethe lattice and directed ring graph examples demonstrate construction of very large graphs within minutes on a single CPU core.
- New community detection and layout algorithms (Leiden, multilevel/Louvain, fluid communities, UMAP) were added to the core.
- Python, R, and Mathematica interfaces expanded for broader accessibility and interoperability, including Jupyter compatibility and in-memory exchanges with networkx and graph-tool.
- Documentation, testing, and continuous integration improvements increased robustness and maintainability across platforms.
- An active open science and diverse community effort with a public forum, governance planning, and WINS collaboration is described.

Read this paper
Open the full text in the Nubint reader and ask about any passage as you read.
Read this paper on NubintThis review was generated by AI from the original paper. Please check the paper before citing it.