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 University

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

0.8.2

This manual is for igraph, version 0.8.2.

Copyright (C) 2005-2020 Gábor Csárdi and Tamás Nepusz. 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 visitors
15. Cliques and Independent Vertex Sets
16. Graph Isomorphism
17. Graph Coloring
18. Graph Motifs, Dyad Census and Triad Census
19. Generating Layouts for Graph Drawing
20. Reading and Writing Graphs from and to Files
21. Maximum Flows, Minimum Cuts and related measures
22. Vertex separators
23. Detecting Community Structure
24. Graphlets
25. Hierarchical random graphs
26. Spectral Coarse Graining
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. Not Graph Related Functions
33. Licenses for igraph and this manual
Index