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

Center for Systems Biology Dresden, Max Planck Institute for Cell Biology and Genetics

Pfotenhauerstr. 108, 01307 Dresden, Germany

Fabio Zanini

Lowy Cancer Research Centre, University of New South Wales

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

0.9.2

This manual is for igraph, version 0.9.2.

Copyright (C) 2005-2019 Gábor Csárdi and Tamás Nepusz. Copyright (C) 2020-2021 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. About igraph graphs, the basic 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. Spectral Coarse Graining
28. Embedding of graphs
29. Graph Operators
30. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs
31. Bipartite, i.e. two-mode graphs
32. Advanced igraph programming
33. Not Graph Related Functions
34. Licenses for igraph and this manual
Index