Merge lp:~mvngu/igraph/doc into lp:~igraph/igraph/0.6-main-old

[Minh Van Nguyen]

A bunch of typo fixes.

[Gábor Csárdi (gabor.csardi)]

Thanks a lot!

review: Approve

[lp:~mvngu/igraph/doc]

2543. By Tamás Nepusz on 2011-09-16

removed a right-recursive rule from the LGL parser, thanks to Gregory Stafford

2544. By Gábor Csárdi on 2011-09-19

C docs fix for leading eigenvector method, thanks to Minh.

2545. By Gábor Csárdi on 2011-09-20

Updated email addresses.

2546. By Tamás Nepusz on 2011-09-19

sorted out a minor type issue in igraph_motifs.h

2547. By Tamás Nepusz on 2011-10-07

compatibility fixes for Python 2.5 + more image viewers for Linux

2548. By Tamás Nepusz on 2011-10-07

igraph_random_sample_alga is now internal

2549. By Gábor Csárdi on 2011-10-10

R: make edges curve automatically when plotting graphs with multiple edges.

2550. By Gábor Csárdi on 2011-10-10

R: interconnected islands game fixed.

2551. By Gábor Csárdi on 2011-10-10

R: fixed a weird tkplot issue, when the layout matrix had column names.

2552. By Tamás Nepusz on 2011-10-18

GraphML files now validate for identical edge & vertex attribute names

2553. By Gábor Csárdi on 2011-10-19

Fixed a bug in igraph_vector_ptr_pop_back. Last element was not returned.

2554. By Gábor Csárdi on 2011-10-19

Fixed some return values in the revolver functions.

2555. By Gábor Csárdi on 2011-10-19

Eliminated some gcc warnings because of unused variables.

2556. By Gábor Csárdi on 2011-10-19

R: eliminated a potentially undefined return value.

2557. By Gábor Csárdi on 2011-10-19

R: handle some enum cases in a switch() that never actually happen. To eliminate gcc warnings.

2558. By Gábor Csárdi on 2011-10-19

Updated stimulus to generate R code without unused variables.

2559. By Gábor Csárdi on 2011-10-19

R: update argument names for onLoad(), as suggested by R docs.

2560. By Gábor Csárdi on 2011-10-19

R: fixed some check NOTEs.

2561. By Gábor Csárdi on 2011-10-19

R: fixed a tkplot bug, when a font family was 'symbol'.

2562. By Gábor Csárdi on 2011-10-20

R: remove '/' from \name in manual pages.

2563. By Gábor Csárdi on 2011-11-02

R: fixed two as.dendogram bugs:
1) 'merges' matrix must be integer
2) 'merges' was misspelled as 'merged'

2564. By Gábor Csárdi on 2011-11-02

Repaired PDF manual building, code examples are omitted from PDF and info manuals.

[Gábor Csárdi (gabor.csardi)]

Added in revision #2565 (0.6-main).

review: Approve

=== modified file 'src/adjlist.c'
--- src/adjlist.c	2011-07-15 09:34:29 +0000
+++ src/adjlist.c	2011-09-12 16:01:36 +0000
@@ -35,7 +35,7 @@
  * <para>Sometimes it is easier to work with a graph which is in
  * adjacency list format: a list of vectors; each vector contains the
  * neighbor vertices or incident edges of a given vertex. Typically,
- * this representation is good if we need to iterate over the neigbors
+ * this representation is good if we need to iterate over the neighbors
  * of all vertices many times. E.g. when finding the shortest paths
  * between every pairs of vertices or calculating closeness centrality
  * for all the vertices.</para>
@@ -515,7 +515,7 @@
  *   (<code>IGRAPH_ALL</code>) are considered. It is ignored for
  *   undirected graphs.
  * \param simplify Constant, it gives whether to simplify the vectors
- *   in the adjacency list (<code>IGRAPH_SIMPLIFY</code>) ot not
+ *   in the adjacency list (<code>IGRAPH_SIMPLIFY</code>) or not
  *   (<code>IGRAPH_DONT_SIMPLIFY</code>).
  * \return Error code.
  * 

=== modified file 'src/bipartite.c'
--- src/bipartite.c	2011-03-01 20:27:49 +0000
+++ src/bipartite.c	2011-09-12 16:01:36 +0000
@@ -454,7 +454,7 @@
  * the graph is indeed bipartite with respect to the given \p types
  * vector. If there is an edge connecting two vertices of the same
  * kind, then an error is reported.
- * \param graph Pointer to an uninitlized graph object, the result is
+ * \param graph Pointer to an uninitialized graph object, the result is
  *   created here.
  * \param types Boolean vector giving the vertex types. The length of
  *   the vector defines the number of vertices in the graph.

=== modified file 'src/cattributes.c'
--- src/cattributes.c	2011-05-02 15:42:15 +0000
+++ src/cattributes.c	2011-09-12 16:01:36 +0000
@@ -3035,7 +3035,7 @@
     igraph_i_cattribute_free_rec(VECTOR(*gal)[j]);
     igraph_vector_ptr_remove(gal, j);
   } else {
-    IGRAPH_WARNING("Cannot remove non-existant graph attribute");
+    IGRAPH_WARNING("Cannot remove non-existent graph attribute");
   }  
 }
 
@@ -3060,7 +3060,7 @@
     igraph_i_cattribute_free_rec(VECTOR(*val)[j]);
     igraph_vector_ptr_remove(val, j);
   } else {
-    IGRAPH_WARNING("Cannot remove non-existant graph attribute");
+    IGRAPH_WARNING("Cannot remove non-existent graph attribute");
   }  
 }
 
@@ -3085,7 +3085,7 @@
     igraph_i_cattribute_free_rec(VECTOR(*eal)[j]);
     igraph_vector_ptr_remove(eal, j);
   } else {
-    IGRAPH_WARNING("Cannot remove non-existant graph attribute");
+    IGRAPH_WARNING("Cannot remove non-existent graph attribute");
   }  
 }
 

=== modified file 'src/centrality.c'
--- src/centrality.c	2011-07-07 11:07:36 +0000
+++ src/centrality.c	2011-09-12 16:01:36 +0000
@@ -454,7 +454,7 @@
 
 /**
  * \function igraph_eigenvector_centrality
- * Eigenvector centrality of the verices
+ * Eigenvector centrality of the vertices
  * 
  * Eigenvector centrality is a measure of the importance of a node in a
  * network. It assigns relative scores to all nodes in the network based

=== modified file 'src/cliques.c'
--- src/cliques.c	2011-03-01 20:27:49 +0000
+++ src/cliques.c	2011-09-12 16:01:36 +0000
@@ -799,7 +799,7 @@
  * in the graph which contains more vertices. 
  * 
  * </para><para>
- * Note that this is not neccessarily the same as a maximal clique,
+ * Note that this is not necessarily the same as a maximal clique,
  * ie. the largest cliques are always maximal but a maximal clique is
  * not always largest.
  *

=== modified file 'src/cocitation.c'
--- src/cocitation.c	2011-07-15 08:42:15 +0000
+++ src/cocitation.c	2011-09-12 16:01:36 +0000
@@ -411,7 +411,7 @@
  *        \endclist
  * 
  * Time complexity: O(nd), n is the number of pairs in the given vector, d is
- * the (maximum) degree of the vertices in the grpah.
+ * the (maximum) degree of the vertices in the graph.
  *
  * \sa \ref igraph_similarity_jaccard() to calculate the Jaccard similarity
  *   between all pairs of a vertex set, or \ref igraph_similarity_dice() and
@@ -524,7 +524,7 @@
  *        \endclist
  * 
  * Time complexity: O(nd), n is the number of edges in the edge selector, d is
- * the (maximum) degree of the vertices in the grpah.
+ * the (maximum) degree of the vertices in the graph.
  *
  * \sa \ref igraph_similarity_jaccard() and \ref igraph_similarity_jaccard_pairs()
  *   to calculate the Jaccard similarity between all pairs of a vertex set or
@@ -669,7 +669,7 @@
  *        \endclist
  * 
  * Time complexity: O(nd), n is the number of pairs in the given vector, d is
- * the (maximum) degree of the vertices in the grpah.
+ * the (maximum) degree of the vertices in the graph.
  *
  * \sa \ref igraph_similarity_dice() to calculate the Dice similarity
  *   between all pairs of a vertex set, or \ref igraph_similarity_jaccard(),
@@ -733,7 +733,7 @@
  *        \endclist
  * 
  * Time complexity: O(nd), n is the number of pairs in the given vector, d is
- * the (maximum) degree of the vertices in the grpah.
+ * the (maximum) degree of the vertices in the graph.
  *
  * \sa \ref igraph_similarity_dice() and \ref igraph_similarity_dice_pairs()
  *   to calculate the Dice similarity between all pairs of a vertex set or

=== modified file 'src/community.c'
--- src/community.c	2011-08-12 13:05:58 +0000
+++ src/community.c	2011-09-12 16:01:36 +0000
@@ -3006,7 +3006,7 @@
    *                               - sum (n(*,j) choose 2)
    *                               + 2 * sum (n(i,j) choose 2).
    *
-   * Since a+b+c+d = (n choose 2) and this goes in the denumerator, we can
+   * Since a+b+c+d = (n choose 2) and this goes in the denominator, we can
    * just as well start dividing each term in a+d by (n choose 2), which
    * yields:
    *

=== modified file 'src/conversion.c'
--- src/conversion.c	2011-03-01 20:27:49 +0000
+++ src/conversion.c	2011-09-12 16:01:36 +0000
@@ -410,7 +410,7 @@
  * If the supplied graph is undirected, this function does nothing.
  * \param graph The graph object to convert.
  * \param mode Constant, specifies the details of how exactly the
- *        convesion is done. Possible values: \c 
+ *        conversion is done. Possible values: \c 
  *        IGRAPH_TO_UNDIRECTED_EACH: the number of edges remains
  *        constant, an undirected edge is created for each directed
  *        one, this version might create graphs with multiple edges; 

=== modified file 'src/decomposition.c'
--- src/decomposition.c	2010-06-28 10:30:37 +0000
+++ src/decomposition.c	2011-09-12 16:01:36 +0000
@@ -102,7 +102,7 @@
     VECTOR(prev)[v]=v;
   }
   VECTOR(next)[no_of_nodes-1] = 0;
-  /* size is allready all zero */
+  /* size is already all zero */
 
   /***************/
   /* i:=n; j:=0; */
@@ -222,7 +222,7 @@
  * chordless cycles have at most three nodes.
  *
  * If either \p alpha or \p alpha1 is given, then the other is
- * calculated by taking simply the inverse. If neighter are given,
+ * calculated by taking simply the inverse. If neither are given,
  * then \ref igraph_maximum_cardinality_search() is called to calculate
  * them.
  * \param graph The input graph, it might be directed, but edge

=== modified file 'src/flow.c'
--- src/flow.c	2011-03-23 05:34:22 +0000
+++ src/flow.c	2011-09-12 16:01:36 +0000
@@ -63,9 +63,9 @@
  * (15) edge connectivity, directed graph
  * (16) edge connectivity, undirected graph
  * (17) s-t vertex connectivity, directed graph
- * (18) s-t vertex connectivity, undireced graph
+ * (18) s-t vertex connectivity, undirected graph
  * (19) vertex connectivity, directed graph
- * (20) vertex connectivity, undireced graph
+ * (20) vertex connectivity, undirected graph
  * (21) s-t number of edge disjoint paths, directed graph
  * (22) s-t number of edge disjoint paths, undirected graph
  * (23) s-t number of vertex disjoint paths, directed graph
@@ -885,7 +885,7 @@
  * target vertex. The maximum flow is the flow with the maximum
  * value. </para>
  * 
- * <para> According to a theorem by Ford and Furkelson 
+ * <para> According to a theorem by Ford and Fulkerson 
  * (L. R. Ford Jr. and D. R. Fulkerson. Maximal flow through a
  * network. Canadian J. Math., 8:399-404, 1956.) the maximum flow
  * between two vertices is the same as the 
@@ -985,7 +985,7 @@
  *        vertices in the first partition of the cut are stored
  *        here. This argument is ignored if it is a null pointer.
  * \param partition2 Pointer to a real vector, the vertex ids of the
- *        vertices in the second partinio of the cut are stored here.
+ *        vertices in the second partition of the cut are stored here.
  *        This argument is ignored if it is a null pointer.
  * \param source Integer, the id of the source vertex.
  * \param target Integer, the id of the target vertex.
@@ -996,7 +996,7 @@
  * 
  * \sa \ref igraph_maxflow().
  * 
- * Time complecity: see \ref igraph_maxflow().
+ * Time complexity: see \ref igraph_maxflow().
  */
 
 int igraph_st_mincut(const igraph_t *graph, igraph_real_t *value,
@@ -1054,7 +1054,7 @@
 /* } */
 
 /*
- * This is the Stoer-Wagner algorithm, it works for calcuating the
+ * This is the Stoer-Wagner algorithm, it works for calculating the
  * minimum cut for undirected graphs, for the whole graph. 
  * I.e. this is basically the edge-connectivity of the graph. 
  * It can also calculate the cut itself, not just the cut value.
@@ -1219,7 +1219,7 @@
     char *mark;
     mark=igraph_Calloc(no_of_nodes, char);
     if (!mark) { 
-      IGRAPH_ERROR("Not enough memory for minumum cut", IGRAPH_ENOMEM);
+      IGRAPH_ERROR("Not enough memory for minimum cut", IGRAPH_ENOMEM);
     }
     IGRAPH_FINALLY(igraph_free, mark);
     
@@ -1401,7 +1401,7 @@
  * This function calculates the minimum cut in a graph. 
  * The minimum cut is the minimum set of edges which needs to be
  * removed to disconnect the graph. The minimum is calculated using
- * the weigths (\p capacity) of the edges, so the cut with the minimum
+ * the weights (\p capacity) of the edges, so the cut with the minimum
  * total capacity is calculated. 
  * 
  * </para><para> For directed graphs an implementation based on
@@ -1717,7 +1717,7 @@
  *     \c IGRAPH_VCONN_NUMBER_OF_NODES, return the number of nodes.
  *     \c IGRAPH_VCONN_IGNORE, ignore the fact that the two vertices
  *        are connected and calculated the number of vertices needed
- *        to aliminate all paths except for the trivial (direct) paths
+ *        to eliminate all paths except for the trivial (direct) paths
  *        between \c source and \c vertex. TOOD: what about neighbors?
  * \return Error code.
  * 
@@ -1862,7 +1862,7 @@
  *    They were suggested by Peter McMahan, thanks Peter.
  * \return Error code.
  * 
- * Time complecity: O(|V|^5).
+ * Time complexity: O(|V|^5).
  * 
  * \sa \ref igraph_st_vertex_connectivity(), \ref igraph_maxflow_value(),
  * and \ref igraph_edge_connectivity(). 
@@ -1997,7 +1997,7 @@
  * \param target The id of the target vertex.
  * \return Error code.
  * 
- * Time complecity: O(|V|^3), but see the discussion at \ref
+ * Time complexity: O(|V|^3), but see the discussion at \ref
  * igraph_maxflow_value().
  * 
  * \sa \ref igraph_vertex_disjoint_paths(), \ref

=== modified file 'src/foreign.c'
--- src/foreign.c	2011-05-02 15:42:15 +0000
+++ src/foreign.c	2011-09-12 16:01:36 +0000
@@ -158,7 +158,7 @@
  * \param instream Pointer to a stream, it should be readable.
  * \param predefnames Pointer to the symbolic names of the vertices in
  *        the file. If \c NULL is given here then vertex ids will be
- *        assigned to vertex names in the order of their appearence in
+ *        assigned to vertex names in the order of their appearance in
  *        the \c .ncol file. If it is not \c NULL and some unknown
  *        vertex names are found in the \c .ncol file then new vertex
  *        ids will be assigned to them. 
@@ -1367,7 +1367,7 @@
     snprintf(name, sizeof(name)/sizeof(char)-1, "%li", to);
     IGRAPH_CHECK(igraph_trie_get(&trie, name, &to));
     if (igraph_trie_size(&trie) != no_of_nodes) {
-      IGRAPH_ERROR("Unkown node id found at an edge", IGRAPH_PARSEERROR);
+      IGRAPH_ERROR("Unknown node id found at an edge", IGRAPH_PARSEERROR);
     }
     VECTOR(edges)[edgeptr++]=from;
     VECTOR(edges)[edgeptr++]=to;
@@ -2339,7 +2339,7 @@
  * file as well, if they are numeric of string.
  * 
  * </para><para> As igraph is more forgiving about attribute names, it might 
- * be neccessary to simplify the them before writing to the GML file.
+ * be necessary to simplify the them before writing to the GML file.
  * This way we'll have a syntactically correct GML file. The following 
  * simple procedure is performed on each attribute name: first the alphanumeric 
  * characters are extracted, the others are ignored. Then if the first character

=== modified file 'src/igraph_hashtable.c'
--- src/igraph_hashtable.c	2009-05-07 17:49:52 +0000
+++ src/igraph_hashtable.c	2011-09-12 16:01:36 +0000
@@ -45,7 +45,7 @@
   igraph_strvector_destroy(&ht->defaults);
 }
 
-/* Note: may leave the hashtable in an inconsistent state if a new
+/* Note: may leave the hash table in an inconsistent state if a new
    element is added, but this is not a big problem, since while the
    defaults, or the defaults plus the elements may contain more elements
    than the keys trie, but the data is always retrieved based on the trie

=== modified file 'src/igraph_strvector.c'
--- src/igraph_strvector.c	2011-05-02 15:42:15 +0000
+++ src/igraph_strvector.c	2011-09-12 16:01:36 +0000
@@ -38,7 +38,7 @@
  * The current implementation is very simple and not too efficient. It
  * works fine for not too many strings, e.g. the list of attribute
  * names is returned in a string vector by \ref
- * igraph_cattribute_list(). Do not expect great performace from this
+ * igraph_cattribute_list(). Do not expect great performance from this
  * type.</para>
  * 
  * <para>
@@ -323,7 +323,7 @@
  * Concatenate two string vectors.
  * 
  * \param to The first string vector, the result is stored here.
- * \param from The second string vector, it is kep unchanged.
+ * \param from The second string vector, it is kept unchanged.
  * \return Error code.
  * 
  * Time complexity: O(n+l2), n is the number of strings in the new
@@ -443,7 +443,7 @@
       if (tmp != 0) {
 	v->data=tmp;
       }
-      IGRAPH_ERROR("canot resize string vector", IGRAPH_ENOMEM);
+      IGRAPH_ERROR("Cannot resize string vector", IGRAPH_ENOMEM);
     }
   }
   v->len = newsize;

=== modified file 'src/igraph_trie.c'
--- src/igraph_trie.c	2009-05-07 17:49:52 +0000
+++ src/igraph_trie.c	2011-09-12 16:01:36 +0000
@@ -338,7 +338,7 @@
   char *tmp=igraph_Calloc(length+1, char);
 
   if (tmp==0) {
-    IGRAPH_ERROR("canot get from trie", IGRAPH_ENOMEM);
+    IGRAPH_ERROR("Cannot get from trie", IGRAPH_ENOMEM);
   }
   
   strncpy(tmp, key, length);

=== modified file 'src/lapack.c'
--- src/lapack.c	2011-03-01 20:27:49 +0000
+++ src/lapack.c	2011-09-12 16:01:36 +0000
@@ -367,7 +367,7 @@
 		 "between 1 and n", IGRAPH_EINVAL);
   }
   if (which==IGRAPH_LAPACK_DSYEV_SELECT && iu-il < 0) {
-    IGRAPH_ERROR("Invalied 'il' and/or 'iu' values", IGRAPH_EINVAL);
+    IGRAPH_ERROR("Invalid 'il' and/or 'iu' values", IGRAPH_EINVAL);
   }
 
   IGRAPH_CHECK(igraph_matrix_copy(&Acopy, A));
@@ -598,7 +598,7 @@
  * Eigenvalues/vectors of nonsymmetric matrices, expert mode
  * 
  * This function calculates the eigenvalues and optionally the left
- * and/or right eigenvectors of a nonsymmetrix N-by-N real matrix.
+ * and/or right eigenvectors of a nonsymmetric N-by-N real matrix.
  * 
  * </para><para>
  * Optionally also, it computes a balancing transformation to improve   

=== modified file 'src/layout.c'
--- src/layout.c	2011-05-02 15:42:15 +0000
+++ src/layout.c	2011-09-12 16:01:36 +0000
@@ -968,7 +968,7 @@
  * algorithm and program
  * (http://bioinformatics.icmb.utexas.edu/lgl/). But unlike LGL, this
  * version uses a Fruchterman-Reingold style simulated annealing
- * algorithm for placing the vertices. The speedup is achived by
+ * algorithm for placing the vertices. The speedup is achieved by
  * placing the vertices on a grid and calculating the repulsion only
  * for vertices which are closer to each other than a limit. 
  * 
@@ -986,7 +986,7 @@
  * \param coolexp The cooling exponent. A reasonable default value is
  *   1.5.
  * \param repulserad Determines the radius at which vertex-vertex 
- *   repulsion cancels out attraction of adjacenct vertices. A
+ *   repulsion cancels out attraction of adjacent vertices. A
  *   reasonable default value is \p area times the number of vertices.
  * \param cellsize The size of the grid cells, one side of the
  *   square. A reasonable default value is the fourth root of
@@ -1999,7 +1999,7 @@
 					    long int this_node) {
   
   // We know what the directed force is.  We now need to translate it
-  // into the appropriate x and y componenets.
+  // into the appropriate x and y components.
   // First, assume: 
   //                 other_node
   //                    /|
@@ -2201,7 +2201,7 @@
  * This is a port of the graphopt layout algorithm by Michael Schmuhl.
  * graphopt version 0.4.1 was rewritten in C and the support for 
  * layers was removed (might be added later) and a code was a bit 
- * reorganized to avoid some unneccessary steps is the node charge (see below) 
+ * reorganized to avoid some unnecessary steps is the node charge (see below) 
  * is zero.
  * 
  * </para><para>
@@ -2304,7 +2304,7 @@
 	  // will only happen in extremely rare circumstances, and when
 	  // it does, springs will probably pull them apart anyway.
 	  // also, if we are more than 50 away, the electric force 
-	  // will be negligable.  
+	  // will be negligible.  
 	  // ***** may not always be desirable ****
 	  if ((distance != 0.0) && (distance < 500.0)) {
 	    //	  if (distance != 0.0) {

=== modified file 'src/mixing.c'
--- src/mixing.c	2011-03-29 02:53:16 +0000
+++ src/mixing.c	2011-09-12 16:01:36 +0000
@@ -29,8 +29,8 @@
  * Assortativity of a graph based on vertex categories
  * 
  * Assuming the vertices of the input graph belong to different
- * categories, this function calculates the assortativity coeffient of
- * the graph. The assortativity coeffient is between minus one and one
+ * categories, this function calculates the assortativity coefficient of
+ * the graph. The assortativity coefficient is between minus one and one
  * and it is one if all connections stay within categories, it is
  * minus one, if the network is perfectly disassortative. For a
  * randomly connected network it is (asymptotically) zero.
@@ -49,7 +49,7 @@
  *    graphs.
  * \return Error code.
  * 
- * Time complecity: O(|E|+t), |E| is the number of edges, t is the
+ * Time complexity: O(|E|+t), |E| is the number of edges, t is the
  * number of vertex types.
  * 
  * \sa \ref igraph_assortativity if the vertex types are defines by

=== modified file 'src/operators.c'
--- src/operators.c	2011-03-01 20:27:49 +0000
+++ src/operators.c	2011-09-12 16:01:36 +0000
@@ -108,7 +108,7 @@
  * \brief The disjint union of many graphs.
  *
  * </para><para>
- * First the vertices in the graphs will be relabed with new vertex
+ * First the vertices in the graphs will be relabeled with new vertex
  * ids to have pairwise disjoint vertex id sets and then the union of
  * the graphs is formed.
  * The number of vertices and edges in the result is the total number
@@ -544,7 +544,7 @@
  * 
  * </para><para> 
  * The result graph will contain as many vertices as the largest graph
- * among the agruments does, and an edge will be included in it if it
+ * among the arguments does, and an edge will be included in it if it
  * is part of at least one operand graph.
  * 
  * </para><para>
@@ -916,7 +916,7 @@
  * 
  * \param res Pointer to an uninitialized graph object, the result
  *        will be stored here.
- * \param g1 The firs operarand, a graph object.
+ * \param g1 The firs operand, a graph object.
  * \param g2 The second operand, another graph object.
  * \return Error code.
  * 

=== modified file 'src/revolver_cit.c'
--- src/revolver_cit.c	2009-05-07 15:43:54 +0000
+++ src/revolver_cit.c	2011-09-12 16:01:36 +0000
@@ -1024,7 +1024,7 @@
 					    maxdegree, agebins));
       }
       
-      /* error calculattion */
+      /* error calculation */
       if (logprob || lognull) {
 	IGRAPH_CHECK(igraph_revolver_error_ade(graph, kernel, &st,
 					      cats, nocats, maxdegree, 

=== modified file 'src/revolver_ml_cit.c'
--- src/revolver_ml_cit.c	2010-10-04 15:57:08 +0000
+++ src/revolver_ml_cit.c	2011-09-12 16:01:36 +0000
@@ -163,7 +163,7 @@
   return data->lastf;
 }
 
-/* This function gievs the gradient of the objective function at
+/* This function gives the gradient of the objective function at
    the supplied parameter vector. Called by the optimizer.
 */
 

=== modified file 'src/sparsemat.c'
--- src/sparsemat.c	2011-05-03 14:54:09 +0000
+++ src/sparsemat.c	2011-09-12 16:01:36 +0000
@@ -91,7 +91,7 @@
  * \param rows The number of rows in the matrix.
  * \param cols The number of columns.
  * \param nzmax The maximum number of non-zero elements in the
- *    matrix. It is not compulsary to get this right, but it is
+ *    matrix. It is not compulsory to get this right, but it is
  *    useful for the allocation of the proper amount of memory.
  * \return Error code.
  * 
@@ -220,7 +220,7 @@
 
 /**
  * \function igraph_sparsemat_type
- * Type of a sprase matrix (triplet or column-compressed)
+ * Type of a sparse matrix (triplet or column-compressed)
  * 
  * Gives whether a sparse matrix is stored in the triplet format or in
  * column-compressed format.
@@ -295,7 +295,7 @@
     IGRAPH_ERROR("Invalid row permutation length", IGRAPH_FAILURE);
   }
   if (ncol != igraph_vector_int_size(q)) {
-    IGRAPH_ERROR("Invalud column permutation length", IGRAPH_FAILURE);
+    IGRAPH_ERROR("Invalid column permutation length", IGRAPH_FAILURE);
   }
 
   /* We invert the permutation by hand */
@@ -669,7 +669,7 @@
 int igraph_sparsemat_droptol(igraph_sparsemat_t *A, igraph_real_t tol) {
   
   if (!cs_droptol(A->cs, tol)) {
-    IGRAPH_ERROR("Cannor drop (almost) zeros from sparse matrix", 
+    IGRAPH_ERROR("Cannot drop (almost) zeros from sparse matrix", 
 		 IGRAPH_FAILURE);
   }
   
@@ -1319,7 +1319,7 @@
 
 /**
  * \function igraph_sparsemat_arpack_rssolve
- * Eigenvalues and eigenvectors of a symmetrix sparse matrix via ARPACK
+ * Eigenvalues and eigenvectors of a symmetric sparse matrix via ARPACK
  * 
  * \param The input matrix, must be column-compressed.
  * \param options It is passed to \ref igraph_arpack_rssolve(). See
@@ -1642,7 +1642,7 @@
  * 
  * Solves a linear system using a QR decomposition of its coefficient
  * matrix.
- * \param dis Symbolic analyis of the coefficient matrix, the result
+ * \param dis Symbolic analysis of the coefficient matrix, the result
  *    of \ref igraph_sparsemat_symbqr().
  * \param din The QR decomposition of the coefficient matrix, the
  *    result of \ref igraph_sparsemat_qr().
@@ -1968,7 +1968,7 @@
  * \function igraph_sparsemat_count_nonzerotol
  * Count nonzero elements of a sparse matrix, ignoring elements close to zero
  * 
- * Count the number of matric entries that are closer to zero than \p
+ * Count the number of matrix entries that are closer to zero than \p
  * tol.
  * \param The input matrix, column-compressed.
  * \param Real scalar, the tolerance. 

=== modified file 'src/st-cuts.c'
--- src/st-cuts.c	2011-03-01 20:27:49 +0000
+++ src/st-cuts.c	2011-09-12 16:01:36 +0000
@@ -865,7 +865,7 @@
   return 0;
 }
 
-/* TODO: This is a temporary resursive version, without proper error
+/* TODO: This is a temporary recursive version, without proper error
    handling */
 
 int igraph_provan_shier_list(const igraph_t *graph,

=== modified file 'src/topology.c'
--- src/topology.c	2011-03-01 20:27:49 +0000
+++ src/topology.c	2011-09-12 16:01:36 +0000
@@ -665,7 +665,7 @@
  * 
  * </para><para>
  * All graphs with a given number of vertices belong to a number of
- * isomorpism classes, with every graph in a given class being
+ * isomorphism classes, with every graph in a given class being
  * isomorphic to each other.
  * 
  * </para><para>
@@ -1016,7 +1016,7 @@
  * matching large graphs, Proc. of the 3rd IAPR-TC-15 International
  * Workshop on Graph-based Representations, Italy, 2001.</para>
  * 
- * <para>For using it you need to define a calback function of type
+ * <para>For using it you need to define a callback function of type
  * \ref igraph_isohandler_t. This function will be called whenever VF2
  * finds an isomorphism between the two graphs. The mapping between
  * the two graphs will be also provided to this function. If the

=== modified file 'src/vector_ptr.c'
--- src/vector_ptr.c	2010-08-11 07:50:53 +0000
+++ src/vector_ptr.c	2011-09-12 16:01:36 +0000
@@ -127,7 +127,7 @@
  * 
  * Time complexity: operating system dependent, the \quote time
  * \endquote required to deallocate O(n) bytes, n is the number of
- * elements allocated for the pointer vector (not neccessarily the
+ * elements allocated for the pointer vector (not necessarily the
  * number of elements in the vector).
  */
 
@@ -293,7 +293,7 @@
 /**
  * \ingroup vectorptr
  * \function igraph_vector_ptr_push_back
- * \brief Appends an elements to the back of a pointer vector.
+ * \brief Appends an element to the back of a pointer vector.
  * 
  * \param v The pointer vector.
  * \param e The new element to include in the pointer vector.
@@ -474,7 +474,7 @@
  *
  * </para><para>
  * This function creates a pointer vector by copying another one. This
- * is shallow copy, only the pointers in the vector will be copyed.
+ * is shallow copy, only the pointers in the vector will be copied.
  *
  * </para><para>
  * It is potentially dangerous to copy a pointer vector with an associated