Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 36 of the 53 references it cites were found in a registry or an index, and 1 are not checked yet; 3 of the 26 sources its claims cite were checked for support.

igraph 1.0 enables fast and robust network analysis across programming languages

Open access

Abstract

Networks or graphs are widely used across the sciences to represent relationships of many kinds. The igraph ( https://igraph.org ) software library supports 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. After twenty years of development, igraph 1.0 has been released, enabling public access to a robust and stable network analysis with over a million monthly downloads. Thanks to its cross-language design, igraph delivers both speed and flexibility: it can handle billions of edges, supports interactive plotting, integrates with notebooks, facilitates conversions to and from other network libraries, includes a rich library of graph layout and community detection algorithms, and has a detailed documentation including non-English 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.

Verified 2026-10-11 · 1 reference not checked yet

Overview

CoChat Summary

## TL;DR

igraph 1.0 is presented as a fast, cross-language graph analysis library with a C core and Python, R, and Mathematica interfaces. The paper argues that it scales to billions of edges, is usually about an order of magnitude faster than NetworkX in the reported benchmarks, and includes broad documentation, testing, and community-support infrastructure.

## Key findings

  • The codebase has had around 3 million lines of code edited across approximately 10,000 versioning commits; as of June 2026, the four main repositories had been forked approximately 800 times and starred 3,000 times.
  • In June 2026, the Python and R packages were downloaded around 2.1 million and 600 thousand times, respectively.
  • Using the C core, constructing an undirected Bethe lattice with 3.2 billion edges took 4 minutes on a server using a single CPU core; similar results were reported for a 400 million-edge random graph and a 3.3 billion-edge directed ring graph.
  • In runtime comparisons against NetworkX, igraph was faster in essentially all cases across 1–30 thousand nodes, “usually by approximately one order of magnitude”; for large graphs, the Python interface was reported to be about 10 times faster than NetworkX, while for small graphs Python overhead reduced that advantage.
  • The R interface is reported to be used by 713 CRAN packages as of June 2026.
  • A workshop with Women in Network Science trained 25 women to use igraph; all expressed interest in continuing to use it, and the authors interpret this as evidence that targeted workshops can help onboard diverse users.

## Methods

  • Performance and comparison tests were run 10 times each, with memory deallocation/garbage collection between runs; scalability tests for Figure 1 were done on a tower server with 512 GB RAM and a single Intel Xeon Platinum 8160T CPU at 2.10 GHz, while comparisons against scikit-network used a laptop with 32 GB RAM and Intel Core Ultra 7 265H CPUs.
  • Graph layout demonstrations used synthetic graphs built from 10 tightly connected groups with random inter-group distances; the Fruchterman-Reingold and UMAP layouts were run on graphs up to 1,000 vertices, and only UMAP on a 100,000-node graph.
  • The paper also reports package statistics from PyPI stats, cranlogs.app, GitHub’s interface, and code/function counts via Python’s `inspect` module and R’s `lsf.str("package:igraph")`.

## Limitations

  • The paper states that igraph’s current internal data structure, based on numbered arrays of vertices and edges, is efficient for static graph analysis but less performant for dynamic networks where vertices and edges are frequently added or removed.
  • It states that the R interface is more limited in network size because R internally uses double precision floating point numbers to represent integers.
  • Evident from the text: the reported benchmarks are limited to the specific hardware, versions, and graph types described, so the results may not generalize to all workloads or implementations.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1371/journal.pone.0355108

Cites

36 of 53 references verified0 citation errors · 16 not checkable

Statistics

Nothing to recompute.

Figures

Fig 1 Runtime scalability of igraph. (A-B) Runtimes to construct (A) and analyse (B) graphs of varying sizes. Top row: Construction runtime of an undirected Bethe lattice or regular tree, an Erdős–Rényi or random graph and a directed ring graph using the igraph C core directly and, for the latter, the Python igraph interface and the networkx library. Bottom row: Analysis runtime – excluding graph construction time – for size-3 motif search, transitivity, and Leiden clustering using the C core. Each graph size was tested 10 times (crosses). Solid lines: averages for each graph size. (C) ratios of average runtimes between igraph (python interface) and networkx for four example algorithms across graph sizes (1-30,000 nodes).
Fig 1 Runtime scalability of igraph. (A-B) Runtimes to construct (A) and analyse (B) graphs of varying sizes. Top row: Construction runtime of an undirected Bethe lattice or regular tree, an Erdős–Rényi or random graph and a directed ring graph using the igraph C core directly and, for the latter, the Python igraph interface and the networkx library. Bottom row: Analysis runtime – excluding graph construction time – for size-3 motif search, transitivity, and Leiden clustering using the C core. Each graph size was tested 10 times (crosses). Solid lines: averages for each graph size. (C) ratios of average runtimes between igraph (python interface) and networkx for four example algorithms across graph sizes (1-30,000 nodes).CC BY · PubMed Central
Fig 2 igraph enables simple and interactive graph visualisation. (A) Example code to plot a simple graph with topological sorting. (B) Examples of graph layouts in igraph. The spring-based Fruchterman-Reingold layout and the Uniform Manifold Approximation and Projection (UMAP) layout algorithms [27] for graphs of increasing size. Plots within brackets are outside of the typical range of applicability of the respective algorithm.
Fig 2 igraph enables simple and interactive graph visualisation. (A) Example code to plot a simple graph with topological sorting. (B) Examples of graph layouts in igraph. The spring-based Fruchterman-Reingold layout and the Uniform Manifold Approximation and Projection (UMAP) layout algorithms [27] for graphs of increasing size. Plots within brackets are outside of the typical range of applicability of the respective algorithm.CC BY · PubMed Central
Fig 3 Linking network libraries together. (A) igraph’s Python interface can exchange in-memory graphs with networkx, [10] graph-tool [11], and pytorch geometric [40]. (B) Example of a network conversion from igraph to networkx and back using the new import/export functions, which preserve attributes as well.
Fig 3 Linking network libraries together. (A) igraph’s Python interface can exchange in-memory graphs with networkx, [10] graph-tool [11], and pytorch geometric [40]. (B) Example of a network conversion from igraph to networkx and back using the new import/export functions, which preserve attributes as well.CC BY · PubMed Central
Fig 4 Schematic of igraph’s open source/open science infrastructure. From the top: development, releases, documentation, internal and external communication channels, and initiatives.
Fig 4 Schematic of igraph’s open source/open science infrastructure. From the top: development, releases, documentation, internal and external communication channels, and initiatives.CC BY · PubMed Central

Verification

Claims the paper makes

1 Valid · 4 Not valid · 17 Not checked · 42 Own results and interpretations

10 more claims

Create a free account to see all 64 claims and to verify the 23 references still open.

See all claims — free account
  • Probably not a substantial claim. 39
  • It may state two separate claims as one. 26
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Citations

Cites

Show all 53 references

Cited by

See all 56

Metadata

Authors
Antonov, M., Csárdi, G., Horvát, S., Müller, K., Nepusz, T., Noom, D., Salmon, M., Traag, V., Welles, B. F., & Zanini, F.
Affiliations
  • cynkra GmbH (Switzerland) (CH)
  • Posit Software, PBC (United States) (US)
  • Reykjavík University (IS)
  • Leiden University (NL)
  • Northeastern University (US)
  • UNSW Sydney (AU)
Corresponding author
  • Horvát, Szabolcs
  • Zanini, Fabio
Venue
PLOS One
Published
2026-08-04
Volume
21
Issue
8
Pages
e0355108
ISSN
1932-6203 (ISSN-L)
OpenAlex
W4388843329
Cited by
56
References
53
Citations by year
2026: 46
FWCI
145.33
Type
journal article
Language
en
Open access
Locations
  • PLoS ONE (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • PubMed Central (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • Opin vísindi (Opin vísindi) (submittedVersion, cc-by-nc-sa)
  • arXiv (Cornell University) (cc-by)
Funders
Chan Zuckerberg Initiative (EOSS2-0000000067, EOSS4-0000000179, EOSS-DI-0000000021)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
  • Social Sciences › Decision Sciences › Information Systems and Management › Scientific Computing and Data Management
Keywords
igraph, network analysis software, graph theory, network visualization, Python interface, R interface, graph layout algorithms, community detection, software robustness, open source software
MeSH terms
Algorithms, Computer Graphics, Humans, Programming Languages, Software

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: igraph 1.0 enables fast and robust network analysis across programming languages. https://app.cochat.ai/papers/10.1371/journal.pone.0355108
The paper
Antonov, M., Csárdi, G., Horvát, S., Müller, K., Nepusz, T., Noom, D., Salmon, M., Traag, V., Welles, B. F., & Zanini, F. (2026). igraph 1.0 enables fast and robust network analysis across programming languages. PLOS One. https://doi.org/10.1371/journal.pone.0355108

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.