[Boost-commit] svn:boost r74783 - trunk/libs/graph/doc

Subject: [Boost-commit] svn:boost r74783 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2011-10-07 17:28:22

Author: jewillco
Date: 2011-10-07 17:28:22 EDT (Fri, 07 Oct 2011)
New Revision: 74783
URL: http://svn.boost.org/trac/boost/changeset/74783

Log:
Fixed typo
Text files modified: 
   trunk/libs/graph/doc/using_adjacency_list.html |     2 +-                                      
   1 files changed, 1 insertions(+), 1 deletions(-)

Modified: trunk/libs/graph/doc/using_adjacency_list.html
==============================================================================
--- trunk/libs/graph/doc/using_adjacency_list.html	(original)
+++ trunk/libs/graph/doc/using_adjacency_list.html	2011-10-07 17:28:22 EDT (Fri, 07 Oct 2011)
@@ -326,7 +326,7 @@
 graph.  See Section <A
 HREF="graph_concepts.html#sec:undirected-graphs">Undirected Graphs</A>
 for a description of the difference between directed and undirected
-graphs in BGL.  The <TT>bidirectealS</TT> selector specifies that the
+graphs in BGL.  The <TT>bidirectionalS</TT> selector specifies that the
 graph will provide the <TT>in_edges()</TT> function as well as the
 <TT>out_edges()</TT> function. This imposes twice as much space
 overhead per edge, which is why <TT>in_edges()</TT> is optional.