Add graph references
This commit is contained in:
Abdelrahman Said
@@ -0,0 +1,212 @@
|
||||
<html>
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||||
<title>Chapter 35. Glossary</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="igraph-Advanced.html" title="Chapter 34. Advanced igraph programming">
|
||||
<link rel="next" href="igraph-Licenses.html" title="Chapter 36. Licenses for igraph and this manual">
|
||||
<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="igraph-Advanced.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-Licenses.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-Glossary"></a>Chapter 35. Glossary</h1></div></div></div>
|
||||
<p>
|
||||
This glossary defines common terms used throughout the igraph
|
||||
documentation.
|
||||
</p>
|
||||
<div class="itemizedlist"><ul class="itemizedlist compact" style="list-style-type: disc; ">
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>attribute</strong></span>: A piece of data
|
||||
associated with a vertex, an edge, or the graph itself. The
|
||||
igraph C library currently supports numeric, string and Boolean
|
||||
attribute values, and provides a means for implementing
|
||||
attribute handlers that support custom types.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>adjacent</strong></span>: Two vertices are
|
||||
called <span class="strong"><strong>adjacent</strong></span> if there is
|
||||
an edge connecting them. This term describes a vertex-to-vertex
|
||||
relation.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>adjacency list</strong></span>: A data
|
||||
structure that associates a list of neighbours (i.e. adjacent
|
||||
vertices) to each vertex.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>adjacency matrix</strong></span>: A
|
||||
representation of a graph as a square matrix.
|
||||
<code class="literal">A_ij</code> gives the number of edge endpoints
|
||||
connecting from the <code class="literal">i</code>th vertex to the
|
||||
<code class="literal">j</code>th vertex. Conventionally, the diagonal of
|
||||
the adjacency matrix of an undirected graph contains
|
||||
<span class="emphasis"><em>twice</em></span> the number of self-loops. All igraph
|
||||
functions follow this convention unless noted otherwise.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>biadjacency matrix</strong></span>: Analogous
|
||||
to the adjacency matrix, but used for bipartite graphs. Element
|
||||
<code class="literal">B_ij</code> gives the number of edges from the
|
||||
<code class="literal">i</code>th vertex of the first group to the
|
||||
<code class="literal">j</code>th vertex of the second group.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>bipartite graph</strong></span>: A graph
|
||||
whose vertices can be partitioned into two groups in such a way
|
||||
that connections are present only between members of different
|
||||
groups.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>complete graph</strong></span>: Also called
|
||||
<span class="strong"><strong>full graph</strong></span> within the context
|
||||
of igraph, a graph in which all pairs of vertices are connected
|
||||
to each other.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>connected graph</strong></span>: A connected
|
||||
graph consists of a single component, in which any vertex is
|
||||
reachable from any other. In igraph, the null graph is not
|
||||
considered connected, as it has not one, but zero components.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>edge</strong></span>: A
|
||||
<span class="strong"><strong>connection</strong></span> between two
|
||||
vertices, also called a <span class="strong"><strong>link</strong></span>.
|
||||
In igraph, edges are referred to by integer indices called
|
||||
<span class="strong"><strong>edge IDs</strong></span>.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>finalizer stack</strong></span>: A global
|
||||
stack used internally by igraph to keep track of currently
|
||||
allocated objects and their destructors, so that they can be
|
||||
automatically destroyed in case of an error.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>game</strong></span>: Within igraph, this
|
||||
term is used for stochastic graph generators, i.e. functions
|
||||
that sample from random graph models.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>graph</strong></span> or
|
||||
<span class="strong"><strong>network</strong></span>: A set of vertices
|
||||
with connections between them. In igraph, graphs may carry
|
||||
associated data in the form of vertex, edge or graph attributes.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>incident</strong></span>: An edge is called
|
||||
<span class="strong"><strong>incident</strong></span> to the vertices that
|
||||
are its endpoints. This term describes a vertex-to-edge
|
||||
relation.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>incidence list</strong></span>: A data
|
||||
structure that associates a list of incident edges to each
|
||||
vertex.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>incidence matrix</strong></span>: A matrix
|
||||
describing the incidence relation between vertices (rows) and
|
||||
edges (columns).
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>membership vector</strong></span>: Membership
|
||||
vectors are a means of encoding a partitioning of items, usually
|
||||
vertices, into several groups. The <code class="literal">i</code>th
|
||||
element of the vector gives an integer identifier of the group
|
||||
the <code class="literal">i</code>th vertex belongs to. Membership vectors
|
||||
are typically used to describe a vertex clustering obtained
|
||||
through community detection, or by identifying the connected
|
||||
components of a graph.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>multi-edges</strong></span> or
|
||||
<span class="strong"><strong>parallel edges</strong></span>: More than one
|
||||
edge connecting the same two vertices. In a directed graph,
|
||||
<code class="literal">a -> b, a -> b</code> are considered parallel
|
||||
edges, but <code class="literal">a -> b, a <- b</code> are not.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>null graph</strong></span>: A graph with no
|
||||
vertices (and no edges).
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>self-loop</strong></span>,
|
||||
<span class="strong"><strong>self-edge</strong></span>, or simply
|
||||
<span class="strong"><strong>loop</strong></span>: An edge that connects a
|
||||
vertex to itself.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>simple graph</strong></span>: A graph that
|
||||
does not have self-loops or multi-edges.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>singleton graph</strong></span>: A graph
|
||||
having a single vertex. This term usually refers to a single
|
||||
vertex with no edges, but note that self-loops may in principle
|
||||
be present.
|
||||
</p></li>
|
||||
<li class="listitem"><p>
|
||||
<span class="strong"><strong>vertex</strong></span>: Graphs consist of
|
||||
vertices, also called <span class="strong"><strong>nodes</strong></span>,
|
||||
that are connected to each other. In igraph, vertices are
|
||||
referred to by integer indices called
|
||||
<span class="strong"><strong>vertex IDs</strong></span>.
|
||||
</p></li>
|
||||
</ul></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="igraph-Advanced.html"><b>← Chapter 34. Advanced igraph programming</b></a></td>
|
||||
<td align="right"><a accesskey="n" href="igraph-Licenses.html"><b>Chapter 36. Licenses for igraph and this manual →</b></a></td>
|
||||
</tr></table>
|
||||
</body>
|
||||
</html>
|
||||
Reference in New Issue
Block a user