Abdelrahman Said
176 lines
10 KiB
HTML
176 lines
10 KiB
HTML
<html>
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||
<title>Chapter 1. Introduction</title>
|
||
<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot">
|
||
<link rel="home" href="index.html" title="igraph Reference Manual">
|
||
<link rel="up" href="index.html" title="igraph Reference Manual">
|
||
<link rel="prev" href="index.html" title="igraph Reference Manual">
|
||
<link rel="next" href="igraph-Installation.html" title="Chapter 2. Installation">
|
||
<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="navigation-header mb-4" width="100%" summary="Navigation header"><div class="btn-group">
|
||
<a accesskey="p" class="btn btn-light" href="index.html"><i class="fa fa-chevron-left"></i>
|
||
Previous
|
||
</a><a accesskey="h" class="btn btn-light" href="index.html"><i class="fa fa-home"></i>
|
||
Home
|
||
</a><a accesskey="n" class="btn btn-light" href="igraph-Installation.html"><i class="fa fa-chevron-right"></i>
|
||
Next
|
||
</a>
|
||
</div></div>
|
||
<div class="chapter">
|
||
<div class="titlepage"><div><div><h1 class="title">
|
||
<a name="igraph-Introduction"></a>Chapter 1. Introduction</h1></div></div></div>
|
||
<div class="toc"><dl class="toc">
|
||
<dt><span class="section"><a href="igraph-Introduction.html#igraph-is-free-software">1. igraph is free software</a></span></dt>
|
||
<dt><span class="section"><a href="igraph-Introduction.html#citing-igraph">2. Citing igraph</a></span></dt>
|
||
</dl></div>
|
||
<p>
|
||
igraph is a library for creating and manipulating graphs.
|
||
You can look at it in two ways: first, igraph contains the implementation
|
||
of quite a lot of graph algorithms. These include classic graph
|
||
algorithms like graph isomorphism, graph girth and connectivity and
|
||
also the new wave graph algorithms like transitivity, graph motifs and
|
||
community structure detection. Skim through the table of contents
|
||
or the index of this book to get an impression of what is available.</p>
|
||
<p>
|
||
Second, igraph provides a platform for developing and/or
|
||
implementing graph algorithms. It has an efficient data structure
|
||
for representing graphs, and a number of other data structures like
|
||
flexible vectors, stacks, heaps, queues, adjacency lists that are useful for implementing graph algorithms. In fact these data structures evolved along with the
|
||
implementation of the classic and non-classic graph algorithms which
|
||
make up the major part of the igraph library. This way, they were fine-tuned
|
||
and checked for correctness several times.
|
||
</p>
|
||
<p>
|
||
Our main goal with developing igraph was to create a graph library
|
||
which is efficient on large, but not extremely large graphs. More
|
||
precisely, it is assumed that the graph(s) fit into the physical
|
||
memory of the computer. Nowadays this means graphs with
|
||
several million vertices and/or edges. Our definition of efficient is
|
||
that it runs fast, both in theory and (more importantly) in practice.
|
||
</p>
|
||
<p>
|
||
We believe that one of the big strengths of igraph is that it can be
|
||
embedded into a higher-level language or environment. Three such
|
||
embeddings (or interfaces if you look at them another way)
|
||
are currently being developed by us: an R
|
||
package, a Python extension module, and a Mathematica (Wolfram Language) package. Others are
|
||
likely to come. High level languages such as R or Python make it
|
||
possible to use graph routines with much greater comfort, without
|
||
actually writing a single line of C code. They have some, usually very
|
||
small, speed penalty compared to the C version, but add ease of use and much
|
||
flexibility. This manual, however, covers only the C library. If you
|
||
want to use Python, R or the Wolfram Language, please see the documentation written
|
||
specifically for these interfaces and come back here only if you are
|
||
interested in some detail which is not covered in those documents.
|
||
</p>
|
||
<p>
|
||
We still consider igraph as a child project. It has much room for
|
||
development and we are sure that it will improve a lot in the near
|
||
future. Any feedback we can get from the users is very important for
|
||
us, as most of the time these questions and comments guide us in what
|
||
to add and what to improve.
|
||
</p>
|
||
<p>
|
||
igraph is open source and distributed under the terms of the GNU GPL
|
||
version 2 or (at your option) any later version.
|
||
We strongly believe that all the algorithms used in science, let that
|
||
be graph theory or not, should have an efficient open-source
|
||
implementation allowing use and modification for anyone.
|
||
</p>
|
||
<div class="section">
|
||
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
|
||
<a name="igraph-is-free-software"></a>1. igraph is free software</h2></div></div></div>
|
||
<p>
|
||
igraph library
|
||
</p>
|
||
<p>
|
||
Copyright (C) 2003-2004 Gábor Csárdi <csardi.gabor@gmail.com>
|
||
</p>
|
||
<p>
|
||
Copyright (C) 2005-2019 Gábor Csárdi <csardi.gabor@gmail.com> and Tamás Nepusz <ntamas@gmail.com>
|
||
</p>
|
||
<p>
|
||
Copyright (C) 2020-2023 The igraph development team
|
||
</p>
|
||
<p>
|
||
This program is free software; you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation; either version 2 of the License, or
|
||
(at your option) any later version.
|
||
</p>
|
||
<p>
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
</p>
|
||
<p>
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program; if not, write to the Free Software
|
||
Foundation, Inc.
|
||
</p>
|
||
</div>
|
||
<div class="section">
|
||
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
|
||
<a name="citing-igraph"></a>2. Citing igraph</h2></div></div></div>
|
||
<p>
|
||
To cite igraph in publications, please use the following
|
||
reference:
|
||
</p>
|
||
<p>
|
||
Gábor Csárdi, Tamás Nepusz: The igraph software package for complex network
|
||
research. InterJournal Complex Systems, 1695, 2006.
|
||
</p>
|
||
<p>
|
||
The igraph C library is assigned the DOI <a class="ulink" href="https://doi.org/10.5281/zenodo.3630268" target="_top">10.5281/zenodo.3630268</a> on Zenodo.
|
||
</p>
|
||
</div>
|
||
</div>
|
||
<table class="navigation-footer" width="100%" summary="Navigation footer" cellpadding="2" cellspacing="0"><tr valign="middle">
|
||
<td align="left"><a accesskey="p" href="index.html"><b>← igraph Reference Manual</b></a></td>
|
||
<td align="right"><a accesskey="n" href="igraph-Installation.html"><b>Chapter 2. Installation →</b></a></td>
|
||
</tr></table>
|
||
</body>
|
||
</html>
|