igraph Reference Manual

For using the igraph C library

Gábor Csárdi

Department of Statistics, Harvard University

1 Oxford street, Cambridge, MA, 02138 USA

Tamás Nepusz

Department of Biological Physics, Eötvös Loránd University

1/a Pázmány Péter sétány, 1117 Budapest, Hungary

Vincent Traag

Centre for Science and Technology Studies, Leiden University

Room B5.31, Kolffpad 1, 2333 BN Leiden, Netherlands

Szabolcs Horvát

Department of Computer Science, Reykjavik University

Menntavegur 1, 102 Reykjavík, Iceland

Fabio Zanini

Lowy Cancer Research Centre, University of New South Wales

Room 211, Botany and High St, Kensington, NSW, 2033, Australia

Daniel Noom

jitjit software development

Amsterdam, Netherlands

0.10.15-1-ga16619502

This manual is for igraph, version 0.10.15-1-ga16619502.

Copyright (C) 2005-2019 Gábor Csárdi and Tamás Nepusz. Copyright (C) 2020-2024 igraph development team. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License”.

1. Introduction
2. Installation
3. Tutorial
4. Basic data types and interface
5. Error handling
6. Memory (de)allocation
7. Data structure library: vector, matrix, other data types
8. Random numbers
9. Graph generators
10. Games on graphs
11. Vertex and edge selectors and sequences, iterators
12. Graph, vertex and edge attributes
13. Structural properties of graphs
14. Graph cycles
15. Graph visitors
16. Cliques and independent vertex sets
17. Graph isomorphism
18. Graph coloring
19. Graph motifs, dyad census and triad census
20. Generating layouts for graph drawing
21. Reading and writing graphs from and to files
22. Maximum flows, minimum cuts and related measures
23. Vertex separators
24. Detecting community structure
25. Graphlets
26. Hierarchical random graphs
27. Embedding of graphs
28. Graph operators
29. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs
30. Bipartite, i.e. two-mode graphs
31. Advanced igraph programming
32. Non-graph related functions
33. Licenses for igraph and this manual
Index