From ea24532da5f15b8e39627f9750bb60dfe917d49e Mon Sep 17 00:00:00 2001
From: Jesse Li <jesse.li2002@gmail.com>
Date: Mon, 18 Jul 2022 22:54:03 -0700
Subject: [PATCH] Clarify docs on what traversal category allowed

---
 doc/Graph.html        | 3 ++-
 doc/graph_traits.html | 4 ++--
 2 files changed, 4 insertions(+), 3 deletions(-)

diff --git a/doc/Graph.html b/doc/Graph.html
index be7ae121..c5d6108a 100644
--- a/doc/Graph.html
+++ b/doc/Graph.html
@@ -87,7 +87,8 @@ This describes the ways in which the vertices and edges of the
 graph can be visited. The choices are <TT>incidence_graph_tag</TT>,
 <TT>adjacency_graph_tag</TT>, <TT>bidirectional_graph_tag</TT>,
 <TT>vertex_list_graph_tag</TT>, <TT>edge_list_graph_tag</TT>, and
-<TT>adjacency_matrix_tag</TT>.
+<TT>adjacency_matrix_tag</TT>. You can also create your own
+tag which should inherit from one or more of the above.
 </td>
 </tr>
 
diff --git a/doc/graph_traits.html b/doc/graph_traits.html
index ab3fa12d..cb5bf240 100644
--- a/doc/graph_traits.html
+++ b/doc/graph_traits.html
@@ -200,9 +200,9 @@ The ways in which the vertices in the graph can be traversed.
 The traversal category tags are:
 <tt>incidence_graph_tag, adjacency_graph_tag,
 bidirectional_graph_tag, vertex_list_graph_tag,
-edge_list_graph_tag, vertex_and_edge_list_graph_tag,
+edge_list_graph_tag,
 adjacency_matrix_tag</tt>. You can also create your own
-tag which should inherit from one of the above.
+tag which should inherit from one or more of the above.
 </td>
 </tr>