Add sorted_erdos_renyi_iterator, from Jeremiah Willcock

[SVN r32119]

index.htm

@@ -145,6 +145,7 @@
                              <li><a href="libs/graph/doc/maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></a>, from Aaron Windsor.</li>
                              <li><a href="libs/graph/doc/lengauer_tarjan_dominator_tree.htm"><tt>lengauer_tarjan_dominator_tree</tt></a>, from JongSoo Park.</li>
                              <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/dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></a> now calls <tt>vis.initialize_vertex</tt> for each vertex during initialization.</li>
                            </ul></li>

libs/graph

@@ -1 +1 @@
-Subproject commit 8041171b334089886c1b9a8475aef154fee345b8
+Subproject commit 5879c83284694351bd6923de04618ecffee075de