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

Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 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 Motifs, Dyad Census and Triad Census
18. Generating Layouts for Graph Drawing
19. Reading and Writing Graphs from and to Files
20. Maximum Flows, Minimum Cuts and related measures
21. Vertex separators
22. Detecting Community Structure
23. Graphlets
24. Hierarchical random graphs
25. Spectral Coarse Graining
26. Graph Operators
27. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs
28. Bipartite, i.e. two-mode graphs
29. Advanced igraph programming
30. Not Graph Related Functions
31. Licenses for igraph and this manual
Index