Ticket #7648: fix_comment_typo.patch

boost/graph/labeled_graph.hpp

@@ -21 +21 @@
 #include <boost/graph/graph_traits.hpp>
 
 // This file implements a utility for creating mappings from arbitrary
-// identifers to the vertices of a graph.
+// identifiers to the vertices of a graph.
 
 namespace boost {
 
@@ -104 +104 @@
     // Tag dispatch on random access containers (i.e., vectors). This function
     // basically requires a) that Container is vector<Label> and that Label
     // is an unsigned integral value. Note that this will resize the vector
-    // to accomodate indices.
+    // to accommodate indices.
     template <typename Container, typename Graph, typename Label, typename Prop>
     std::pair<typename graph_traits<Graph>::vertex_descriptor, bool>
     insert_labeled_vertex(Container& c, Graph& g, Label const& l, Prop const& p,
@@ -112 +112 @@
     {
         typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
 
-        // If the label is out of bounds, resize the vector to accomodate.
+        // If the label is out of bounds, resize the vector to accommodate.
         // Resize by 2x the index so we don't cause quadratic insertions over
         // time.
         if(l >= c.size()) {
@@ -246 +246 @@
  * vertex labels and vertex descriptors.
  *
  * @todo This class is somewhat redundant for adjacency_list<*, vecS>  if
- * the intended label is an unsigned int (and perhpahs some other cases), but
+ * the intended label is an unsigned int (and perhaps some other cases), but
  * it does avoid some weird ambiguities (i.e. adding a vertex with a label that
  * does not match its target index).
  *
@@ -310 +310 @@
         _map.insert(_map.end(), rng.first, rng.second);
     }
 
-    // Construct a grpah over n vertices, each of which receives a label from
+    // Construct a graph over n vertices, each of which receives a label from
     // the range [l, l + n). Note that the graph is not directly constructed
     // over the n vertices, but added sequentially. This constructor is
     // necessarily slower than the underlying counterpart.

boost/graph/detail/labeled_graph_traits.hpp

@@ -218 +218 @@
 #define LABELED_GRAPH_PARAMS typename G, typename L, typename S
 #define LABELED_GRAPH labeled_graph<G,L,S>
 
-// Specialize mutability traits for for the labeled graph.
+// Specialize mutability traits for the labeled graph.
 // This specialization depends on the mutability of the underlying graph type.
-// If the underlying graph is fully mutable, this this is also fully mutable.
+// If the underlying graph is fully mutable, this is also fully mutable.
 // Otherwise, it's different.
 template <LABELED_GRAPH_PARAMS>
 struct graph_mutability_traits< LABELED_GRAPH > {