Add documentation, static_asserts for Bidirectional Graph support in adjacency_matrix

[SVN r32706]

1 files changed, 1 insertions, 0 deletions

diff --git a/index.htm b/index.htm
index f85f2078d4..2037b3539a 100644
--- a/index.htm
+++ b/index.htm
@@ -160,6 +160,7 @@
                              <li><a href="libs/graph/doc/compressed_sparse_row.html"><tt>compressed_sparse_row_graph</tt></a>, from Jeremiah Willcock and Douglas Gregor of Indiana University.</li>
                              <li><a href="sorted_erdos_renyi_generator.html"><tt>sorted_erdos_renyi_iterator</tt></a>, from Jeremiah Willcock of Indiana University.</li>
                              <li><a href="libs/graph/doc/biconnected_components.html"><tt>biconnected_components</tt></a> now supports a visitor and named parameters, from Janusz Piwowarski.</li>
+                             <li><a href="libs/graph/doc/adjacency_matrix.html"><tt>adjacency_matrix</tt></a> now models the <a href="libs/graph/doc/BidirectionalGraph.html">Bidirectional Graph</a> concept.</li>
                              <li><a href="libs/graph/doc/dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></a> now calls <tt>vis.initialize_vertex</tt> for each vertex during initialization.</li>
                              <li>See the <a href="libs/graph/doc/history.html#1.34.0">complete revision history</a> for more information.</li>
                            </ul></li>