Abdelrahman Said
166 lines
11 KiB
HTML
166 lines
11 KiB
HTML
<html>
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||
<title>igraph Reference Manual</title>
|
||
<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot">
|
||
<link rel="home" href="index.html" title="igraph Reference Manual">
|
||
<link rel="next" href="igraph-Introduction.html" title="Chapter 1. Introduction">
|
||
<script type="text/javascript" src="toggle.js"></script><link rel="stylesheet" href="style.css" type="text/css">
|
||
<link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/font-awesome/4.7.0/css/font-awesome.min.css" type="text/css">
|
||
<link rel="chapter" href="igraph-Introduction.html" title="Chapter 1. Introduction">
|
||
<link rel="chapter" href="igraph-Installation.html" title="Chapter 2. Installation">
|
||
<link rel="chapter" href="igraph-Tutorial.html" title="Chapter 3. Tutorial">
|
||
<link rel="chapter" href="igraph-Basic.html" title="Chapter 4. Basic data types and interface">
|
||
<link rel="chapter" href="igraph-Error.html" title="Chapter 5. Error handling">
|
||
<link rel="chapter" href="igraph-Memory.html" title="Chapter 6. Memory (de)allocation">
|
||
<link rel="chapter" href="igraph-Data-structures.html" title="Chapter 7. Data structure library: vector, matrix, other data types">
|
||
<link rel="chapter" href="igraph-Random.html" title="Chapter 8. Random numbers">
|
||
<link rel="chapter" href="igraph-Iterators.html" title="Chapter 9. Vertex and edge selectors and sequences, iterators">
|
||
<link rel="chapter" href="igraph-Attributes.html" title="Chapter 10. Graph, vertex and edge attributes">
|
||
<link rel="chapter" href="igraph-Generators.html" title="Chapter 11. Deterministic graph generators">
|
||
<link rel="chapter" href="igraph-Games.html" title='Chapter 12. Stochastic graph generators ("games")'>
|
||
<link rel="chapter" href="igraph-Bipartite.html" title="Chapter 13. Bipartite, i.e. two-mode graphs">
|
||
<link rel="chapter" href="igraph-Spatial.html" title="Chapter 14. Spatial graphs">
|
||
<link rel="chapter" href="igraph-Operators.html" title="Chapter 15. Graph operators">
|
||
<link rel="chapter" href="igraph-Visitors.html" title="Chapter 16. Graph visitors">
|
||
<link rel="chapter" href="igraph-Structural.html" title="Chapter 17. Structural properties of graphs">
|
||
<link rel="chapter" href="igraph-Cycles.html" title="Chapter 18. Graph cycles">
|
||
<link rel="chapter" href="igraph-Cliques.html" title="Chapter 19. Cliques and independent vertex sets">
|
||
<link rel="chapter" href="igraph-Motifs.html" title="Chapter 20. Graph motifs, dyad census and triad census">
|
||
<link rel="chapter" href="igraph-Isomorphism.html" title="Chapter 21. Graph isomorphism">
|
||
<link rel="chapter" href="igraph-Coloring.html" title="Chapter 22. Graph coloring">
|
||
<link rel="chapter" href="igraph-Flows.html" title="Chapter 23. Maximum flows, minimum cuts and related measures">
|
||
<link rel="chapter" href="igraph-Separators.html" title="Chapter 24. Vertex separators">
|
||
<link rel="chapter" href="igraph-Community.html" title="Chapter 25. Detecting community structure">
|
||
<link rel="chapter" href="igraph-Graphlets.html" title="Chapter 26. Graphlets">
|
||
<link rel="chapter" href="igraph-HRG.html" title="Chapter 27. Hierarchical random graphs">
|
||
<link rel="chapter" href="igraph-Embedding.html" title="Chapter 28. Embedding of graphs">
|
||
<link rel="chapter" href="igraph-Layout.html" title="Chapter 29. Generating layouts for graph drawing">
|
||
<link rel="chapter" href="igraph-Processes.html" title="Chapter 30. Processes on graphs">
|
||
<link rel="chapter" href="igraph-Foreign.html" title="Chapter 31. Reading and writing graphs from and to files">
|
||
<link rel="chapter" href="igraph-Linalg.html" title="Chapter 32. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs">
|
||
<link rel="chapter" href="igraph-Nongraph.html" title="Chapter 33. Non-graph related functions">
|
||
<link rel="chapter" href="igraph-Advanced.html" title="Chapter 34. Advanced igraph programming">
|
||
<link rel="chapter" href="igraph-Glossary.html" title="Chapter 35. Glossary">
|
||
<link rel="chapter" href="igraph-Licenses.html" title="Chapter 36. Licenses for igraph and this manual">
|
||
<link rel="index" href="ix01.html" title="Index">
|
||
</head>
|
||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
||
<div class="book">
|
||
<div class="titlepage">
|
||
<div>
|
||
<div></div>
|
||
<div><div class="authorgroup">
|
||
<div class="author">
|
||
<h3 class="author">
|
||
<span class="firstname">Gábor</span> <span class="surname">Csárdi</span>
|
||
</h3>
|
||
<div class="affiliation">
|
||
<span class="orgname">Department of Statistics, Harvard University<br></span><div class="address"><p>1 Oxford street, Cambridge, MA, 02138 USA</p></div>
|
||
</div>
|
||
</div>
|
||
<div class="author">
|
||
<h3 class="author">
|
||
<span class="firstname">Tamás</span> <span class="surname">Nepusz</span>
|
||
</h3>
|
||
<div class="affiliation">
|
||
<span class="orgname">Department of Biological Physics, Eötvös Loránd University<br></span><div class="address"><p>1/a Pázmány Péter sétány, 1117 Budapest, Hungary</p></div>
|
||
</div>
|
||
</div>
|
||
<div class="author">
|
||
<h3 class="author">
|
||
<span class="firstname">Vincent</span> <span class="surname">Traag</span>
|
||
</h3>
|
||
<div class="affiliation">
|
||
<span class="orgname">Centre for Science and Technology Studies, Leiden University<br></span><div class="address"><p>Room B5.31, Kolffpad 1, 2333 BN Leiden, Netherlands</p></div>
|
||
</div>
|
||
</div>
|
||
<div class="author">
|
||
<h3 class="author">
|
||
<span class="firstname">Szabolcs</span> <span class="surname">Horvát</span>
|
||
</h3>
|
||
<div class="affiliation">
|
||
<span class="orgname">Department of Computer Science, Reykjavik University<br></span><div class="address"><p>Menntavegur 1, 102 Reykjavík, Iceland</p></div>
|
||
</div>
|
||
</div>
|
||
<div class="author">
|
||
<h3 class="author">
|
||
<span class="firstname">Fabio</span> <span class="surname">Zanini</span>
|
||
</h3>
|
||
<div class="affiliation">
|
||
<span class="orgname">Lowy Cancer Research Centre, University of New South Wales<br></span><div class="address"><p>Room 211, Botany and High St, Kensington, NSW, 2033, Australia</p></div>
|
||
</div>
|
||
</div>
|
||
<div class="author">
|
||
<h3 class="author">
|
||
<span class="firstname">Daniel</span> <span class="surname">Noom</span>
|
||
</h3>
|
||
<div class="affiliation">
|
||
<span class="orgname">jitjit software development<br></span><div class="address"><p>Amsterdam, Netherlands</p></div>
|
||
</div>
|
||
</div>
|
||
</div></div>
|
||
<div><p class="releaseinfo">1.0.1</p></div>
|
||
<div><div class="legalnotice">
|
||
<a name="id-1.1.4"></a><p>This manual is for igraph, version 1.0.1.</p>
|
||
<p>
|
||
Copyright (C) 2005-2019 Gábor Csárdi and Tamás Nepusz.
|
||
Copyright (C) 2020-2025 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
|
||
<span class="quote">“<span class="quote">GNU Free Documentation License</span>”</span>.
|
||
</p>
|
||
</div></div>
|
||
</div>
|
||
<hr>
|
||
</div>
|
||
<div class="toc"><dl class="toc">
|
||
<dt><span class="chapter"><a href="igraph-Introduction.html">1. Introduction</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Installation.html">2. Installation</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Tutorial.html">3. Tutorial</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Basic.html">4. Basic data types and interface</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Error.html">5. Error handling</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Memory.html">6. Memory (de)allocation</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Data-structures.html">7. Data structure library: vector, matrix, other data types</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Random.html">8. Random numbers</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Iterators.html">9. Vertex and edge selectors and sequences, iterators</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Attributes.html">10. Graph, vertex and edge attributes</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Generators.html">11. Deterministic graph generators</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Games.html">12. Stochastic graph generators ("games")</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Bipartite.html">13. Bipartite, i.e. two-mode graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Spatial.html">14. Spatial graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Operators.html">15. Graph operators</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Visitors.html">16. Graph visitors</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Structural.html">17. Structural properties of graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Cycles.html">18. Graph cycles</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Cliques.html">19. Cliques and independent vertex sets</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Motifs.html">20. Graph motifs, dyad census and triad census</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Isomorphism.html">21. Graph isomorphism</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Coloring.html">22. Graph coloring</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Flows.html">23. Maximum flows, minimum cuts and related measures</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Separators.html">24. Vertex separators</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Community.html">25. Detecting community structure</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Graphlets.html">26. Graphlets</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-HRG.html">27. Hierarchical random graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Embedding.html">28. Embedding of graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Layout.html">29. Generating layouts for graph drawing</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Processes.html">30. Processes on graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Foreign.html">31. Reading and writing graphs from and to files</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Linalg.html">32. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Nongraph.html">33. Non-graph related functions </a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Advanced.html">34. Advanced igraph programming</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Glossary.html">35. Glossary</a></span></dt>
|
||
<dt><span class="chapter"><a href="igraph-Licenses.html">36. Licenses for igraph and this manual</a></span></dt>
|
||
<dt><span class="index"><a href="ix01.html">Index</a></span></dt>
|
||
</dl></div>
|
||
</div>
|
||
<table class="navigation-footer" width="100%" summary="Navigation footer" cellpadding="2" cellspacing="0"><tr valign="middle">
|
||
<td align="left"></td>
|
||
<td align="right"><a accesskey="n" href="igraph-Introduction.html"><b>Chapter 1. Introduction →</b></a></td>
|
||
</tr></table>
|
||
</body>
|
||
</html>
|