updated docs

docs/docs/algorithms.xml

@@ -74,6 +74,7 @@
                <item>is_clique</item> 
                <item>is_maximal_clique</item> 
                <item>copy_graph_structure</item> 
+               <item>copy_graph</item> 
                <item>edge</item> 
                <item>is_join_tree</item> 
                <item>create_join_tree</item> 
@@ -840,6 +841,20 @@
                                  
       </component>
 
+   <!-- ************************************************************************* -->
+
+      <component>
+         <name>copy_graph</name>
+         <file>dlib/graph_utils.h</file>
+         <spec_file link="true">dlib/graph_utils/graph_utils_abstract.h</spec_file>
+         <description>        
+            This function takes a <a href="containers.html#graph">graph</a> or 
+            <a href="containers.html#directed_graph">directed_graph</a> and
+            makes a copy of it.
+         </description>
+                                 
+      </component>
+
    <!-- ************************************************************************* -->
 
       <component>

docs/docs/term_index.xml

@@ -152,6 +152,7 @@
          <term file="algorithms.html" name="graph_has_symmetric_edges"/>
          <term file="algorithms.html" name="graph_contains_directed_cycle"/>
          <term file="algorithms.html" name="copy_graph_structure"/>
+         <term file="algorithms.html" name="copy_graph"/>
 
          <term file="algorithms.html" name="create_moral_graph"/>
          <term file="algorithms.html" name="triangulate_graph_and_find_cliques"/>