From 212451425dc742ab314ab19c9535f13358cfcd9a Mon Sep 17 00:00:00 2001
From: "Jeremy W. Murphy" <jeremy.william.murphy@gmail.com>
Date: Thu, 12 Sep 2024 09:43:39 +1000
Subject: [PATCH 1/3] Fix broken links to incremental components

---
 doc/disjoint_sets.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/disjoint_sets.html b/doc/disjoint_sets.html
index eaebe45a4..45ef4a98c 100644
--- a/doc/disjoint_sets.html
+++ b/doc/disjoint_sets.html
@@ -169,7 +169,7 @@ <h3>Complexity</h3>
   very slowly, much more slowly than the <i>log</i> function.</p>
 
   <h3>See Also</h3><a href=
-  "../graph/doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
+  "../doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
   <hr>
   <pre>
 disjoint_sets_with_storage&lt;ID,InverseID,FindCompress&gt;
@@ -181,7 +181,7 @@ <h3>See Also</h3><a href=
   The rank and parent properties are initialized during construction so the
   each element is in a set by itself (so it is not necessary to initialize
   objects of this class with the <a href=
-  "../graph/doc/incremental_components.html#sec:initialize-incremental-components">
+  "../doc/incremental_components.html#sec:initialize-incremental-components">
   <tt>initialize_incremental_components()</tt></a> function). This class is
   especially useful when computing the (dynamic) connected components of an
   <tt>edge_list</tt> graph which does not provide a place to store vertex

From 3184d9a084f79c5891342782b73346d6d82ce051 Mon Sep 17 00:00:00 2001
From: "Jeremy W. Murphy" <jeremy.william.murphy@gmail.com>
Date: Thu, 12 Sep 2024 09:49:54 +1000
Subject: [PATCH 2/3] Fix broken link to disjoint_sets

---
 doc/incremental_components.html | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/incremental_components.html b/doc/incremental_components.html
index 181791be3..a0c9de00d 100644
--- a/doc/incremental_components.html
+++ b/doc/incremental_components.html
@@ -43,7 +43,7 @@ <H1>Incremental Connected Components</H1>
 hence it is called <b><i>incremental</i></b><a
 href="bibliography.html#eppstein97:dynamic_graph">[42]</a> (and not
 fully dynamic). The disjoint-sets class is described in Section <A
-HREF="../../disjoint_sets/disjoint_sets.html">Disjoint Sets</A>.
+HREF="disjoint_sets.html">Disjoint Sets</A>.
 
 <P>
 The following five operations are the primary functions that you will

From 41d39a516240adba30c1019ab610f203db8c6a7d Mon Sep 17 00:00:00 2001
From: "Jeremy W. Murphy" <jeremy.william.murphy@gmail.com>
Date: Thu, 12 Sep 2024 09:51:00 +1000
Subject: [PATCH 3/3] Update disjoint_sets.html

Remove unnecessary dir prefix
---
 doc/disjoint_sets.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/disjoint_sets.html b/doc/disjoint_sets.html
index 45ef4a98c..e5cb41daf 100644
--- a/doc/disjoint_sets.html
+++ b/doc/disjoint_sets.html
@@ -169,7 +169,7 @@ <h3>Complexity</h3>
   very slowly, much more slowly than the <i>log</i> function.</p>
 
   <h3>See Also</h3><a href=
-  "../doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
+  "incremental_components.html"><tt>incremental_connected_components()</tt></a>
   <hr>
   <pre>
 disjoint_sets_with_storage&lt;ID,InverseID,FindCompress&gt;
@@ -181,7 +181,7 @@ <h3>See Also</h3><a href=
   The rank and parent properties are initialized during construction so the
   each element is in a set by itself (so it is not necessary to initialize
   objects of this class with the <a href=
-  "../doc/incremental_components.html#sec:initialize-incremental-components">
+  "incremental_components.html#sec:initialize-incremental-components">
   <tt>initialize_incremental_components()</tt></a> function). This class is
   especially useful when computing the (dynamic) connected components of an
   <tt>edge_list</tt> graph which does not provide a place to store vertex