diff --git a/algorithms/BFS.md b/algorithms/BFS.md
index aabe12a..328170c 100644
--- a/algorithms/BFS.md
+++ b/algorithms/BFS.md
@@ -1,3 +1,13 @@
+---
+title: Breadth First Search Algorithm Implementation and Analysis
+category: algorithms
+tags:
+  - graph-traversal
+  - shortest-paths
+  - graph-theory
+  - complexity-analysis
+description: A comprehensive explanation of the Breadth First Search (BFS) algorithm, including implementation, complexity analysis, and mathematical proofs. The document covers the algorithm's properties for finding shortest paths in graphs and includes Python implementations with detailed theoretical foundations and lemmas about level ordering.
+---
 # Breadth First Search
 
 Completely explore the vertices of a graph in order of their distance from the starting node.
diff --git a/algorithms/DAGs.md b/algorithms/DAGs.md
index 29e31c9..b03c006 100644
--- a/algorithms/DAGs.md
+++ b/algorithms/DAGs.md
@@ -1,3 +1,14 @@
+---
+title: Topological Ordering and Properties of Directed Acyclic Graphs
+category: algorithms
+tags:
+  - graph theory
+  - topological sorting
+  - directed acyclic graphs
+  - proofs
+description: A technical exploration of Directed Acyclic Graphs (DAGs) focusing on their topological ordering properties and fundamental lemmas. The document includes mathematical proofs of key DAG properties and presents a Python implementation of the topological sorting algorithm.
+---
+
 # Directed Acyclic Graphs (DAGs)
 
 DAGs are pretty self explanatory, but their use cases are vast.
diff --git a/algorithms/DFS.md b/algorithms/DFS.md
index 1a0ca94..7fda972 100644
--- a/algorithms/DFS.md
+++ b/algorithms/DFS.md
@@ -1,3 +1,14 @@
+---
+title: Depth First Search Algorithm and Tree Properties
+category: algorithms
+tags:
+  - graph theory
+  - depth first search
+  - spanning trees
+  - graph traversal
+description: A technical explanation of Depth First Search (DFS) algorithm and its tree properties, including both recursive and iterative implementations. The document covers key properties of DFS trees, including the ancestor-descendant relationship of non-tree edges, and includes a formal lemma and proof about DFS tree characteristics.
+---
+
 # Depth First Search (DFS)
 
 Running DFS on a graph produces a DFS tree (or depth-first spanning-tree). The DFS tree contains all the vertices of the graph and the edges of the DFS tree are a subset of the edges of the original graph.
diff --git a/algorithms/approximation-algorithms.md b/algorithms/approximation-algorithms.md
index c5814f9..4801105 100644
--- a/algorithms/approximation-algorithms.md
+++ b/algorithms/approximation-algorithms.md
@@ -1,3 +1,14 @@
+---
+title: Approximation Algorithms
+category: algorithms
+tags:
+    - approximation
+    - algorithms
+    - vertex cover
+    - set cover
+description: A survey of approximation algorithms, including the 2-approximation for vertex cover and the log(n) approximation for set cover.
+---
+
 # Approximation Algorithms
 
 When faced with a problem that can be reduced to some NP-Complete problem, you (most probably) cannot generally solve it in polynomial time. For example:
diff --git a/algorithms/bipartite-graphs.md b/algorithms/bipartite-graphs.md
index 13ecce5..10eaf3f 100644
--- a/algorithms/bipartite-graphs.md
+++ b/algorithms/bipartite-graphs.md
@@ -1,3 +1,14 @@
+---
+title: Bipartite Graphs Properties, Proofs, and Detection Algorithm
+category: Graph Theory
+tags:
+  - bipartite graphs
+  - graph coloring
+  - odd cycles
+  - breadth-first search
+description: A comprehensive overview of bipartite graphs, including their formal definition and key properties related to vertex coloring and odd-length cycles. The document presents important lemmas about the relationship between bipartite graphs and odd cycles, along with proofs using BFS layer analysis for bipartite graph detection.
+---
+
 # Bipartite Graphs
 
 - **Definition**: An undirected graph $G = (V, E)$ is bipartite if there exists a partition of $V$ into two sets $V_1$ and $V_2$ such that every edge in $E$ has one endpoint in $V_1$ and the other in $V_2$.
diff --git a/algorithms/connected-components.md b/algorithms/connected-components.md
index 1210b56..f378493 100644
--- a/algorithms/connected-components.md
+++ b/algorithms/connected-components.md
@@ -1,3 +1,14 @@
+---
+title: Finding Connected Components in Undirected Graphs Using BFS/DFS
+category: algorithms
+tags:
+  - graph theory
+  - connected components
+  - breadth-first search
+  - depth-first search
+description: Explains how to partition an undirected graph into connected components using BFS or DFS algorithms in O(|V| + |E|) time complexity. Includes Python implementation using adjacency lists and demonstrates how to create a data structure that enables O(1) time queries for path existence between vertices.
+---
+
 # Connected Components
 
 Given an undirected graph $G = (V, E)$, you can find partition $V$ into sets of connected components $C_1, C_2, \ldots$ in $O(|V| + |E|)$ using breadth-first search (BFS) or depth-first search (DFS).
diff --git a/algorithms/divide-and-conquer.md b/algorithms/divide-and-conquer.md
index 3a30f2e..334ef03 100644
--- a/algorithms/divide-and-conquer.md
+++ b/algorithms/divide-and-conquer.md
@@ -1,3 +1,14 @@
+---
+title: Divide and Conquer Algorithm Analysis with Implementation Examples
+category: algorithms
+tags:
+  - divide-and-conquer
+  - algorithmic-complexity
+  - recursive-algorithms
+  - computational-geometry
+description: A comprehensive examination of divide and conquer algorithmic strategies, focusing on their implementation and analysis. The document covers theoretical foundations with mathematical proofs, practical examples including bisection method and closest pair problem, and includes Python implementations demonstrating these concepts.
+---
+
 # Divide and Conquer
 
 Reduce problem to multiple sub-problems. While in induction, you typically only reduce your problem size by 1, with divide and conquer it is more common to reduce to some constant fraction of your original problem size. After recursively solving each sub-problem, merge the solutions.
diff --git a/algorithms/dynamic-programming.md b/algorithms/dynamic-programming.md
index 76a401a..0a0329c 100644
--- a/algorithms/dynamic-programming.md
+++ b/algorithms/dynamic-programming.md
@@ -1,3 +1,14 @@
+---
+title: Dynamic Programming Algorithms and Problem Solutions Guide
+category: algorithms
+tags:
+  - dynamic-programming
+  - optimization
+  - algorithm-analysis
+  - problem-solving
+description: A comprehensive guide covering various dynamic programming algorithms and their implementations, including knapsack, sequence alignment, and tree-based problems. Includes detailed explanations of problem-solving approaches, correctness proofs, and runtime analysis for each algorithm, with practical Python implementations.
+---
+
 # Dynamic Programming
 
 **Dynamic Programming** is an algorithmic paradigm where you break up a problem into a series of **overlapping** sub-problems, building up solutions to progressively larger subproblems until the original answer is obtained. The key efficiency of DP is to **memoize** the answers to sub problems, often yielding a polynomial time algorithm.
diff --git a/algorithms/graphs-intro.md b/algorithms/graphs-intro.md
index 1b3898d..8d8bf29 100644
--- a/algorithms/graphs-intro.md
+++ b/algorithms/graphs-intro.md
@@ -1,3 +1,14 @@
+---
+title: Introduction to Undirected Graphs and Their Properties
+category: Graph Theory
+tags:
+  - graph fundamentals
+  - graph representation
+  - graph properties
+  - data structures
+description: A comprehensive introduction to undirected graphs covering fundamental concepts, properties, and storage methods. The document explains key terminology, proves important theorems about degree sums and odd vertices, and compares adjacency matrix and list representations with their respective time and space complexities.
+---
+
 # Graphs Introduction
 
 ## Undirected Graphs
diff --git a/algorithms/greedy-algorithms.md b/algorithms/greedy-algorithms.md
index 60a900b..7398673 100644
--- a/algorithms/greedy-algorithms.md
+++ b/algorithms/greedy-algorithms.md
@@ -1,3 +1,15 @@
+---
+title: Greedy Algorithms for Interval Scheduling and Partitioning
+category: Algorithm Analysis
+tags:
+  - Greedy Algorithms
+  - Interval Scheduling
+  - Interval Partitioning
+  - Proof Techniques
+  - Optimization
+description: This document explores greedy algorithms for interval scheduling and partitioning problems. It provides detailed explanations of the algorithms, including Python implementations, and presents rigorous proofs of correctness using techniques such as "Greedy Stays Ahead" and exchange arguments.
+---
+
  # Greedy Algorithms
 
 Choose the most attractive choice at each step, and hope that this will lead to the optimal solution. Proofs of correctness are particularly important for greedy algorithms.
diff --git a/algorithms/induction.md b/algorithms/induction.md
index eda4191..add452e 100644
--- a/algorithms/induction.md
+++ b/algorithms/induction.md
@@ -1,3 +1,16 @@
+---
+title: Mathematical Induction and Pigeonhole Principle Proofs
+category: Mathematics
+tags:
+  - Induction
+  - Pigeonhole Principle
+  - Proof Techniques
+  - Number Theory
+  - Combinatorics
+description: This document presents detailed proofs using mathematical induction and the pigeonhole principle. It demonstrates the inductive proof for the sum of natural numbers and provides a step-by-step proof of the pigeonhole principle, emphasizing the general approach to inductive reasoning in mathematics.
+---
+
+
 # Induction
 
 Prove...
diff --git a/algorithms/linear-programming.md b/algorithms/linear-programming.md
index fc23401..4a9ad85 100644
--- a/algorithms/linear-programming.md
+++ b/algorithms/linear-programming.md
@@ -1,3 +1,15 @@
+---
+title: Linear Programming Fundamentals and Applications in Optimization
+category: Operations Research
+tags:
+  - Linear Systems
+  - Linear Programs
+  - Optimization
+  - Standard Form
+  - Application Examples
+description: This document provides a comprehensive overview of linear programming, covering linear systems, linear programs, and their standard forms. It explains key concepts such as hyperplanes, polytopes, and convex sets, and demonstrates how to transform various optimization problems into linear programs. The document also explores practical applications of linear programming in areas like max-flow and weighted vertex cover problems.
+---
+
 # Linear Programming
 
 ## Linear Systems
diff --git a/algorithms/network-flows.md b/algorithms/network-flows.md
index ee8b0e9..7000500 100644
--- a/algorithms/network-flows.md
+++ b/algorithms/network-flows.md
@@ -1,3 +1,15 @@
+---
+title: Network Flow Algorithms and Applications in Graph Theory
+category: Graph Theory
+tags:
+  - Max Flow Min Cut
+  - Ford-Fulkerson Algorithm
+  - Bipartite Matching
+  - Vertex Cover
+  - Independent Set
+description: Comprehensive overview of network flow algorithms, including Max Flow/Min Cut and Ford-Fulkerson. Covers applications in bipartite matching, vertex cover, and independent set problems. Includes proofs, algorithms, and problem-solving techniques for graph theory concepts.
+---
+
 # Network Flow - Max Flow and Min Cut
 
 ## Max Flow/Min Cut
diff --git a/algorithms/runtime.md b/algorithms/runtime.md
index 6d85416..d7c2a10 100644
--- a/algorithms/runtime.md
+++ b/algorithms/runtime.md
@@ -1,3 +1,14 @@
+---
+title: Measuring Algorithm Efficiency with Asymptotic Notation
+category: Computer Science
+tags:
+  - Algorithm Analysis
+  - Time Complexity
+  - Asymptotic Notation
+  - Efficiency Bounds
+description: This document introduces methods for measuring algorithm efficiency using asymptotic notation. It defines O-notation, Omega-notation, and Theta-notation, and provides common efficiency bounds for various function types, emphasizing the importance of polynomial-time algorithms in practical computing.
+---
+
 # Measuring Efficiency
 
 Time is roughly proportional to the number of operations performed. Generally, this holds for simple operations. As a side note, you should avoid hashing.
diff --git a/algorithms/tmp.md b/algorithms/tmp.md
deleted file mode 100644
index 1aaad09..0000000
--- a/algorithms/tmp.md
+++ /dev/null
@@ -1,9 +0,0 @@
-#1 
-
-The knights have a bipartite coloring
-
-Each vertex is a square, and there are edges between two vertices
-
-Independent set problem: find the largest set of vertices such that no two vertices are connected by an edge
-
-
diff --git a/algorithms/tree-intro.md b/algorithms/tree-intro.md
index ec480b4..584bd09 100644
--- a/algorithms/tree-intro.md
+++ b/algorithms/tree-intro.md
@@ -1,3 +1,15 @@
+---
+title: Tree Properties and Proof of Edge Count
+category: Graph Theory
+tags:
+  - Trees
+  - Acyclic Graphs
+  - Connected Graphs
+  - Induction Proofs
+  - Graph Properties
+description: This document explores the fundamental properties of trees in graph theory. It provides a proof by induction that a tree with n vertices has n-1 edges and outlines three key properties of trees, demonstrating their interconnected nature.
+---
+
 # Trees
 
 ### Lemma: acyclic and connected
diff --git a/site/README.html b/site/README.html
index 812e893..51fa1bb 100644
--- a/site/README.html
+++ b/site/README.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/algorithms/BFS.html b/site/algorithms/BFS.html
index 4bb170f..2f67723 100644
--- a/site/algorithms/BFS.html
+++ b/site/algorithms/BFS.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Bfs</title>
+    <title>Breadth First Search Algorithm Implementation and Analysis</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Bfs
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Breadth First Search Algorithm Implementation and Analysis
         </div>
-        <h1>Bfs</h1>
+        <h1>Breadth First Search Algorithm Implementation and Analysis</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-03</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
-            <h1 id="breadth-first-search">Breadth First Search</h1>
+            <ul>
+<li>graph-traversal</li>
+<li>shortest-paths</li>
+<li>graph-theory</li>
+<li>complexity-analysis
+description: A comprehensive explanation of the Breadth First Search (BFS) algorithm, including implementation, complexity analysis, and mathematical proofs. The document covers the algorithm's properties for finding shortest paths in graphs and includes Python implementations with detailed theoretical foundations and lemmas about level ordering.</li>
+</ul>
+<hr />
+<h1 id="breadth-first-search">Breadth First Search</h1>
 <p>Completely explore the vertices of a graph in order of their distance from the starting node.</p>
 <p>There are three states of a vertex in BFS:
 - <strong>Undiscovered</strong>: The vertex has not been seen yet.
diff --git a/site/algorithms/DAGs.html b/site/algorithms/DAGs.html
index 485851a..47ba597 100644
--- a/site/algorithms/DAGs.html
+++ b/site/algorithms/DAGs.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Dags</title>
+    <title>Topological Ordering and Properties of Directed Acyclic Graphs</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Dags
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Topological Ordering and Properties of Directed Acyclic Graphs
         </div>
-        <h1>Dags</h1>
+        <h1>Topological Ordering and Properties of Directed Acyclic Graphs</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-14</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
-            <h1 id="directed-acyclic-graphs-dags">Directed Acyclic Graphs (DAGs)</h1>
+            <ul>
+<li>graph theory</li>
+<li>topological sorting</li>
+<li>directed acyclic graphs</li>
+<li>proofs
+description: A technical exploration of Directed Acyclic Graphs (DAGs) focusing on their topological ordering properties and fundamental lemmas. The document includes mathematical proofs of key DAG properties and presents a Python implementation of the topological sorting algorithm.</li>
+</ul>
+<hr />
+<h1 id="directed-acyclic-graphs-dags">Directed Acyclic Graphs (DAGs)</h1>
 <p>DAGs are pretty self explanatory, but their use cases are vast.</p>
 <h2 id="topological-orderings">Topological Orderings</h2>
 <p>A <strong>topological ordering</strong> of a directed graph $G = (V, E)$ is a linear ordering of all its vertices such that for every directed edge $(v_i, v_j) \in E$, $v_i$ comes before $v_j$ in the ordering if $v_i &lt; v_j$.</p>
diff --git a/site/algorithms/DFS.html b/site/algorithms/DFS.html
index 1c31284..541355a 100644
--- a/site/algorithms/DFS.html
+++ b/site/algorithms/DFS.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Dfs</title>
+    <title>Depth First Search Algorithm and Tree Properties</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Dfs
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Depth First Search Algorithm and Tree Properties
         </div>
-        <h1>Dfs</h1>
+        <h1>Depth First Search Algorithm and Tree Properties</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-13</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
-            <h1 id="depth-first-search-dfs">Depth First Search (DFS)</h1>
+            <ul>
+<li>graph theory</li>
+<li>depth first search</li>
+<li>spanning trees</li>
+<li>graph traversal
+description: A technical explanation of Depth First Search (DFS) algorithm and its tree properties, including both recursive and iterative implementations. The document covers key properties of DFS trees, including the ancestor-descendant relationship of non-tree edges, and includes a formal lemma and proof about DFS tree characteristics.</li>
+</ul>
+<hr />
+<h1 id="depth-first-search-dfs">Depth First Search (DFS)</h1>
 <p>Running DFS on a graph produces a DFS tree (or depth-first spanning-tree). The DFS tree contains all the vertices of the graph and the edges of the DFS tree are a subset of the edges of the original graph.</p>
 <p>Unlike the BFS tree, DFS trees aren't minimum depth, and its levels don't really tell you much. However, the property holds that sub-trees of a DFS tree must not contain any edges connecting them.</p>
 <p><strong>Lemma</strong>: For a DFS tree of graph $G = (V, E)$ $T = (V_t, E_t)$,  $\forall e = (x, y) \in E$, if $e \notin E_t$, then one of $x$ or $y$ is an ancestor of the other in the tree.</p>
diff --git a/site/algorithms/approximation-algorithms.html b/site/algorithms/approximation-algorithms.html
index 64692e4..5a0d334 100644
--- a/site/algorithms/approximation-algorithms.html
+++ b/site/algorithms/approximation-algorithms.html
@@ -4,7 +4,7 @@
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
     <title>Approximation Algorithms</title>
-    
+    <meta name="description" content="A survey of approximation algorithms, including the 2-approximation for vertex cover and the log(n) approximation for set cover.">
     <style>
         :root {
             --text-color: #2c3e50;
@@ -170,15 +170,16 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Approximation Algorithms
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Approximation Algorithms
         </div>
         <h1>Approximation Algorithms</h1>
         <div class="meta">
-            <span>Last modified: 2024-05-06</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
             <h1 id="approximation-algorithms">Approximation Algorithms</h1>
diff --git a/site/algorithms/bipartite-graphs.html b/site/algorithms/bipartite-graphs.html
index 4413237..25da34d 100644
--- a/site/algorithms/bipartite-graphs.html
+++ b/site/algorithms/bipartite-graphs.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Bipartite Graphs</title>
+    <title>Bipartite Graphs Properties, Proofs, and Detection Algorithm</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Bipartite Graphs
+            <a href="/index.html">Home</a> » <a href="/categories/graph%20theory.html">Graph Theory</a> » Bipartite Graphs Properties, Proofs, and Detection Algorithm
         </div>
-        <h1>Bipartite Graphs</h1>
+        <h1>Bipartite Graphs Properties, Proofs, and Detection Algorithm</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-10</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/graph%20theory.html">Graph Theory</a></span>
         </div>
         <div class="content">
-            <h1 id="bipartite-graphs">Bipartite Graphs</h1>
+            <ul>
+<li>bipartite graphs</li>
+<li>graph coloring</li>
+<li>odd cycles</li>
+<li>breadth-first search
+description: A comprehensive overview of bipartite graphs, including their formal definition and key properties related to vertex coloring and odd-length cycles. The document presents important lemmas about the relationship between bipartite graphs and odd cycles, along with proofs using BFS layer analysis for bipartite graph detection.</li>
+</ul>
+<hr />
+<h1 id="bipartite-graphs">Bipartite Graphs</h1>
 <ul>
 <li><strong>Definition</strong>: An undirected graph $G = (V, E)$ is bipartite if there exists a partition of $V$ into two sets $V_1$ and $V_2$ such that every edge in $E$ has one endpoint in $V_1$ and the other in $V_2$.</li>
 <li><strong>Applications</strong>:</li>
diff --git a/site/algorithms/connected-components.html b/site/algorithms/connected-components.html
index 6692c10..1a2eb5d 100644
--- a/site/algorithms/connected-components.html
+++ b/site/algorithms/connected-components.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Connected Components</title>
+    <title>Finding Connected Components in Undirected Graphs Using BFS/DFS</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Connected Components
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Finding Connected Components in Undirected Graphs Using BFS/DFS
         </div>
-        <h1>Connected Components</h1>
+        <h1>Finding Connected Components in Undirected Graphs Using BFS/DFS</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-10</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
-            <h1 id="connected-components">Connected Components</h1>
+            <ul>
+<li>graph theory</li>
+<li>connected components</li>
+<li>breadth-first search</li>
+<li>depth-first search
+description: Explains how to partition an undirected graph into connected components using BFS or DFS algorithms in O(|V| + |E|) time complexity. Includes Python implementation using adjacency lists and demonstrates how to create a data structure that enables O(1) time queries for path existence between vertices.</li>
+</ul>
+<hr />
+<h1 id="connected-components">Connected Components</h1>
 <p>Given an undirected graph $G = (V, E)$, you can find partition $V$ into sets of connected components $C_1, C_2, \ldots$ in $O(|V| + |E|)$ using breadth-first search (BFS) or depth-first search (DFS).</p>
 <p>In other words, we can create a data structure from $G$ such that given two vertices $u, v \in V$, we  we answer whether there exists a path from $u \to v$ in $O(1)$ time and $O(|V|)$ space.</p>
 <p>The basic idea is to run a BFS/DFS starting at every vertex, and to assign a label to each vertex we visit during this traversal. We can use an array (if vertices are numbered) or hash map to store the vertex to component set mapping $V \to C_i$</p>
diff --git a/site/algorithms/divide-and-conquer.html b/site/algorithms/divide-and-conquer.html
index 013eed4..b32c088 100644
--- a/site/algorithms/divide-and-conquer.html
+++ b/site/algorithms/divide-and-conquer.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Divide And Conquer</title>
+    <title>Divide and Conquer Algorithm Analysis with Implementation Examples</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Divide And Conquer
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Divide and Conquer Algorithm Analysis with Implementation Examples
         </div>
-        <h1>Divide And Conquer</h1>
+        <h1>Divide and Conquer Algorithm Analysis with Implementation Examples</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-25</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
-            <h1 id="divide-and-conquer">Divide and Conquer</h1>
+            <ul>
+<li>divide-and-conquer</li>
+<li>algorithmic-complexity</li>
+<li>recursive-algorithms</li>
+<li>computational-geometry
+description: A comprehensive examination of divide and conquer algorithmic strategies, focusing on their implementation and analysis. The document covers theoretical foundations with mathematical proofs, practical examples including bisection method and closest pair problem, and includes Python implementations demonstrating these concepts.</li>
+</ul>
+<hr />
+<h1 id="divide-and-conquer">Divide and Conquer</h1>
 <p>Reduce problem to multiple sub-problems. While in induction, you typically only reduce your problem size by 1, with divide and conquer it is more common to reduce to some constant fraction of your original problem size. After recursively solving each sub-problem, merge the solutions.</p>
 <p><strong>Examples</strong>: Merge-sort, Binary Search, Strassen's Algorithm</p>
 <h2 id="why-balanced-partitioning">Why Balanced Partitioning?</h2>
diff --git a/site/algorithms/dynamic-programming.html b/site/algorithms/dynamic-programming.html
index d5ca909..f7dfcab 100644
--- a/site/algorithms/dynamic-programming.html
+++ b/site/algorithms/dynamic-programming.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Dynamic Programming</title>
+    <title>Dynamic Programming Algorithms and Problem Solutions Guide</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Dynamic Programming
+            <a href="/index.html">Home</a> » <a href="/categories/algorithms.html">algorithms</a> » Dynamic Programming Algorithms and Problem Solutions Guide
         </div>
-        <h1>Dynamic Programming</h1>
+        <h1>Dynamic Programming Algorithms and Problem Solutions Guide</h1>
         <div class="meta">
-            <span>Last modified: 2024-05-17</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithms.html">algorithms</a></span>
         </div>
         <div class="content">
-            <h1 id="dynamic-programming">Dynamic Programming</h1>
+            <ul>
+<li>dynamic-programming</li>
+<li>optimization</li>
+<li>algorithm-analysis</li>
+<li>problem-solving
+description: A comprehensive guide covering various dynamic programming algorithms and their implementations, including knapsack, sequence alignment, and tree-based problems. Includes detailed explanations of problem-solving approaches, correctness proofs, and runtime analysis for each algorithm, with practical Python implementations.</li>
+</ul>
+<hr />
+<h1 id="dynamic-programming">Dynamic Programming</h1>
 <p><strong>Dynamic Programming</strong> is an algorithmic paradigm where you break up a problem into a series of <strong>overlapping</strong> sub-problems, building up solutions to progressively larger subproblems until the original answer is obtained. The key efficiency of DP is to <strong>memoize</strong> the answers to sub problems, often yielding a polynomial time algorithm.</p>
 <p>You can design dynamic programming algorithms by induction, with the added construct of somehow memorizing/caching previously solved problems. The key then becomes finding a valid recurrence relation that relates a given instance of the problem to its composite subproblems.</p>
 <h2 id="weighted-interval-scheduling">Weighted Interval Scheduling</h2>
diff --git a/site/algorithms/graphs-intro.html b/site/algorithms/graphs-intro.html
index dd6985d..e7c4fcf 100644
--- a/site/algorithms/graphs-intro.html
+++ b/site/algorithms/graphs-intro.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Graphs Intro</title>
+    <title>Introduction to Undirected Graphs and Their Properties</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Graphs Intro
+            <a href="/index.html">Home</a> » <a href="/categories/graph%20theory.html">Graph Theory</a> » Introduction to Undirected Graphs and Their Properties
         </div>
-        <h1>Graphs Intro</h1>
+        <h1>Introduction to Undirected Graphs and Their Properties</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-03</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/graph%20theory.html">Graph Theory</a></span>
         </div>
         <div class="content">
-            <h1 id="graphs-introduction">Graphs Introduction</h1>
+            <ul>
+<li>graph fundamentals</li>
+<li>graph representation</li>
+<li>graph properties</li>
+<li>data structures
+description: A comprehensive introduction to undirected graphs covering fundamental concepts, properties, and storage methods. The document explains key terminology, proves important theorems about degree sums and odd vertices, and compares adjacency matrix and list representations with their respective time and space complexities.</li>
+</ul>
+<hr />
+<h1 id="graphs-introduction">Graphs Introduction</h1>
 <h2 id="undirected-graphs">Undirected Graphs</h2>
 <p>An undirected graph is defined by a set of vertices and a set of edges.</p>
 <p>$$
diff --git a/site/algorithms/greedy-algorithms.html b/site/algorithms/greedy-algorithms.html
index 82ed90b..19e8435 100644
--- a/site/algorithms/greedy-algorithms.html
+++ b/site/algorithms/greedy-algorithms.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Greedy Algorithms</title>
+    <title>Greedy Algorithms for Interval Scheduling and Partitioning</title>
     
     <style>
         :root {
@@ -170,18 +170,28 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Greedy Algorithms
+            <a href="/index.html">Home</a> » <a href="/categories/algorithm%20analysis.html">Algorithm Analysis</a> » Greedy Algorithms for Interval Scheduling and Partitioning
         </div>
-        <h1>Greedy Algorithms</h1>
+        <h1>Greedy Algorithms for Interval Scheduling and Partitioning</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-19</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/algorithm%20analysis.html">Algorithm Analysis</a></span>
         </div>
         <div class="content">
-            <p># Greedy Algorithms</p>
+            <ul>
+<li>Greedy Algorithms</li>
+<li>Interval Scheduling</li>
+<li>Interval Partitioning</li>
+<li>Proof Techniques</li>
+<li>Optimization
+description: This document explores greedy algorithms for interval scheduling and partitioning problems. It provides detailed explanations of the algorithms, including Python implementations, and presents rigorous proofs of correctness using techniques such as "Greedy Stays Ahead" and exchange arguments.</li>
+</ul>
+<hr />
+<p># Greedy Algorithms</p>
 <p>Choose the most attractive choice at each step, and hope that this will lead to the optimal solution. Proofs of correctness are particularly important for greedy algorithms.</p>
 <p>## Interval Scheduling</p>
 <p>Job $j$ starts at $s(j)$ and finishes at $f(j)$. Two jobs are compatible if they don't overlap. The goal is to schedule as many jobs as possible without overlapping.</p>
diff --git a/site/algorithms/induction.html b/site/algorithms/induction.html
index 8d7e8ac..e09d082 100644
--- a/site/algorithms/induction.html
+++ b/site/algorithms/induction.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Induction</title>
+    <title>Mathematical Induction and Pigeonhole Principle Proofs</title>
     
     <style>
         :root {
@@ -170,18 +170,28 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Induction
+            <a href="/index.html">Home</a> » <a href="/categories/mathematics.html">Mathematics</a> » Mathematical Induction and Pigeonhole Principle Proofs
         </div>
-        <h1>Induction</h1>
+        <h1>Mathematical Induction and Pigeonhole Principle Proofs</h1>
         <div class="meta">
-            <span>Last modified: 2024-03-27</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/mathematics.html">Mathematics</a></span>
         </div>
         <div class="content">
-            <h1 id="induction">Induction</h1>
+            <ul>
+<li>Induction</li>
+<li>Pigeonhole Principle</li>
+<li>Proof Techniques</li>
+<li>Number Theory</li>
+<li>Combinatorics
+description: This document presents detailed proofs using mathematical induction and the pigeonhole principle. It demonstrates the inductive proof for the sum of natural numbers and provides a step-by-step proof of the pigeonhole principle, emphasizing the general approach to inductive reasoning in mathematics.</li>
+</ul>
+<hr />
+<h1 id="induction">Induction</h1>
 <p>Prove...</p>
 <p>$$
 \forall n \in \mathbb{N}, \sum^{n}_{i = 1} i = \frac{n(n + 1)}{2}
diff --git a/site/algorithms/linear-programming.html b/site/algorithms/linear-programming.html
index 4af3d64..441a34b 100644
--- a/site/algorithms/linear-programming.html
+++ b/site/algorithms/linear-programming.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Linear Programming</title>
+    <title>Linear Programming Fundamentals and Applications in Optimization</title>
     
     <style>
         :root {
@@ -170,18 +170,28 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Linear Programming
+            <a href="/index.html">Home</a> » <a href="/categories/operations%20research.html">Operations Research</a> » Linear Programming Fundamentals and Applications in Optimization
         </div>
-        <h1>Linear Programming</h1>
+        <h1>Linear Programming Fundamentals and Applications in Optimization</h1>
         <div class="meta">
-            <span>Last modified: 2024-05-25</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/operations%20research.html">Operations Research</a></span>
         </div>
         <div class="content">
-            <h1 id="linear-programming">Linear Programming</h1>
+            <ul>
+<li>Linear Systems</li>
+<li>Linear Programs</li>
+<li>Optimization</li>
+<li>Standard Form</li>
+<li>Application Examples
+description: This document provides a comprehensive overview of linear programming, covering linear systems, linear programs, and their standard forms. It explains key concepts such as hyperplanes, polytopes, and convex sets, and demonstrates how to transform various optimization problems into linear programs. The document also explores practical applications of linear programming in areas like max-flow and weighted vertex cover problems.</li>
+</ul>
+<hr />
+<h1 id="linear-programming">Linear Programming</h1>
 <h2 id="linear-systems">Linear Systems</h2>
 <p>Systems of linear equations (key word being equality) can be solved via gaussian elimination. This is relatively easy, since your solution space ends up being a line, a plane, or a hyperplane in higher dimensions.</p>
 <p>Let $a$ be a column vector in $\mathbb{R}^d$, and $x$ a column vector of $d$ variables. We can represent a system using the <em>inner product</em> of these two vectors:</p>
diff --git a/site/algorithms/network-flows.html b/site/algorithms/network-flows.html
index 3d02747..9211e3b 100644
--- a/site/algorithms/network-flows.html
+++ b/site/algorithms/network-flows.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Network Flows</title>
+    <title>Network Flow Algorithms and Applications in Graph Theory</title>
     
     <style>
         :root {
@@ -170,18 +170,28 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Network Flows
+            <a href="/index.html">Home</a> » <a href="/categories/graph%20theory.html">Graph Theory</a> » Network Flow Algorithms and Applications in Graph Theory
         </div>
-        <h1>Network Flows</h1>
+        <h1>Network Flow Algorithms and Applications in Graph Theory</h1>
         <div class="meta">
-            <span>Last modified: 2024-05-24</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/graph%20theory.html">Graph Theory</a></span>
         </div>
         <div class="content">
-            <h1 id="network-flow-max-flow-and-min-cut">Network Flow - Max Flow and Min Cut</h1>
+            <ul>
+<li>Max Flow Min Cut</li>
+<li>Ford-Fulkerson Algorithm</li>
+<li>Bipartite Matching</li>
+<li>Vertex Cover</li>
+<li>Independent Set
+description: Comprehensive overview of network flow algorithms, including Max Flow/Min Cut and Ford-Fulkerson. Covers applications in bipartite matching, vertex cover, and independent set problems. Includes proofs, algorithms, and problem-solving techniques for graph theory concepts.</li>
+</ul>
+<hr />
+<h1 id="network-flow-max-flow-and-min-cut">Network Flow - Max Flow and Min Cut</h1>
 <h2 id="max-flowmin-cut">Max Flow/Min Cut</h2>
 <p><strong>Max Flow</strong> and <strong>Min Cut</strong> are two important concepts in graph theory with wide reaching applications. Many problems are reduced to either of them, such as...</p>
 <ul>
diff --git a/site/algorithms/patterns/BFS.html b/site/algorithms/patterns/BFS.html
index b0042f9..10bad10 100644
--- a/site/algorithms/patterns/BFS.html
+++ b/site/algorithms/patterns/BFS.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/algorithms/patterns/sliding-window.html b/site/algorithms/patterns/sliding-window.html
index 6600262..e921df8 100644
--- a/site/algorithms/patterns/sliding-window.html
+++ b/site/algorithms/patterns/sliding-window.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/algorithms/practice/4.html b/site/algorithms/practice/4.html
index 6f637b3..453565c 100644
--- a/site/algorithms/practice/4.html
+++ b/site/algorithms/practice/4.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/algorithms/problems/graphs-and-trees.html b/site/algorithms/problems/graphs-and-trees.html
index d9042a3..e0c4796 100644
--- a/site/algorithms/problems/graphs-and-trees.html
+++ b/site/algorithms/problems/graphs-and-trees.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/algorithms/runtime.html b/site/algorithms/runtime.html
index 1817358..17571f6 100644
--- a/site/algorithms/runtime.html
+++ b/site/algorithms/runtime.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Runtime</title>
+    <title>Measuring Algorithm Efficiency with Asymptotic Notation</title>
     
     <style>
         :root {
@@ -170,18 +170,27 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Runtime
+            <a href="/index.html">Home</a> » <a href="/categories/computer%20science.html">Computer Science</a> » Measuring Algorithm Efficiency with Asymptotic Notation
         </div>
-        <h1>Runtime</h1>
+        <h1>Measuring Algorithm Efficiency with Asymptotic Notation</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-01</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/computer%20science.html">Computer Science</a></span>
         </div>
         <div class="content">
-            <h1 id="measuring-efficiency">Measuring Efficiency</h1>
+            <ul>
+<li>Algorithm Analysis</li>
+<li>Time Complexity</li>
+<li>Asymptotic Notation</li>
+<li>Efficiency Bounds
+description: This document introduces methods for measuring algorithm efficiency using asymptotic notation. It defines O-notation, Omega-notation, and Theta-notation, and provides common efficiency bounds for various function types, emphasizing the importance of polynomial-time algorithms in practical computing.</li>
+</ul>
+<hr />
+<h1 id="measuring-efficiency">Measuring Efficiency</h1>
 <p>Time is roughly proportional to the number of operations performed. Generally, this holds for simple operations. As a side note, you should avoid hashing.</p>
 <h2 id="o-notation-definition">O-Notation Definition</h2>
 <p>Given two functions $f(n)$ and $g(n)$, we say that $f(n)$ is $O(g(n))$ if there exist constants $c$ and $n_0$ such that $0 \leq f(n) \leq c \cdot g(n)$ for all $n \geq n_0$.</p>
diff --git a/site/algorithms/stable-matching.html b/site/algorithms/stable-matching.html
index 22fb085..2f9b9ae 100644
--- a/site/algorithms/stable-matching.html
+++ b/site/algorithms/stable-matching.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/algorithms/tree-intro.html b/site/algorithms/tree-intro.html
index 30efb67..956bfee 100644
--- a/site/algorithms/tree-intro.html
+++ b/site/algorithms/tree-intro.html
@@ -3,7 +3,7 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Tree Intro</title>
+    <title>Tree Properties and Proof of Edge Count</title>
     
     <style>
         :root {
@@ -170,18 +170,28 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Tree Intro
+            <a href="/index.html">Home</a> » <a href="/categories/graph%20theory.html">Graph Theory</a> » Tree Properties and Proof of Edge Count
         </div>
-        <h1>Tree Intro</h1>
+        <h1>Tree Properties and Proof of Edge Count</h1>
         <div class="meta">
-            <span>Last modified: 2024-04-03</span>
-            
+            <span>Last modified: 2025-01-01</span>
+            <span>Category: <a href="/categories/graph%20theory.html">Graph Theory</a></span>
         </div>
         <div class="content">
-            <h1 id="trees">Trees</h1>
+            <ul>
+<li>Trees</li>
+<li>Acyclic Graphs</li>
+<li>Connected Graphs</li>
+<li>Induction Proofs</li>
+<li>Graph Properties
+description: This document explores the fundamental properties of trees in graph theory. It provides a proof by induction that a tree with n vertices has n-1 edges and outlines three key properties of trees, demonstrating their interconnected nature.</li>
+</ul>
+<hr />
+<h1 id="trees">Trees</h1>
 <h3 id="lemma-acyclic-and-connected">Lemma: acyclic and connected</h3>
 <p>A graph is a tree if and only if it is acyclic and connected.</p>
 <h2 id="claim-every-tree-with-n-vertices-has-n-1-edges">Claim: Every tree with $n$ vertices has $n - 1$ edges.</h2>
diff --git a/site/categories/algorithm analysis.html b/site/categories/algorithm analysis.html
new file mode 100644
index 0000000..f8636cf
--- /dev/null
+++ b/site/categories/algorithm analysis.html	
@@ -0,0 +1,192 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Category: Algorithm Analysis</title>
+    <meta name="description" content="Pages in category Algorithm Analysis">
+    <style>
+        :root {
+            --text-color: #2c3e50;
+            --background-color: #ffffff;
+            --accent-color: #3498db;
+            --border-color: #ecf0f1;
+            --nav-background: rgba(255, 255, 255, 0.9);
+        }
+
+        @media (prefers-color-scheme: dark) {
+            :root {
+                --text-color: #ecf0f1;
+                --background-color: #2c3e50;
+                --accent-color: #3498db;
+                --border-color: #34495e;
+                --nav-background: rgba(44, 62, 80, 0.9);
+            }
+        }
+
+        body {
+            font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            line-height: 1.6;
+            max-width: 50rem;
+            margin: 0 auto;
+            padding: 2rem;
+            color: var(--text-color);
+            background: var(--background-color);
+        }
+
+        nav {
+            position: sticky;
+            top: 0;
+            background: var(--nav-background);
+            backdrop-filter: blur(10px);
+            border-bottom: 1px solid var(--border-color);
+            padding: 1rem 0;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+            z-index: 1000;
+        }
+
+        nav a {
+            color: var(--accent-color);
+            text-decoration: none;
+            padding: 0.5rem 1rem;
+            border-radius: 4px;
+            transition: background-color 0.2s;
+        }
+
+        nav a:hover {
+            background-color: var(--border-color);
+        }
+
+        .breadcrumbs {
+            margin-bottom: 2rem;
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+
+        .breadcrumbs a {
+            color: var(--accent-color);
+            text-decoration: none;
+        }
+
+        .content {
+            margin-top: 2rem;
+        }
+
+        h1, h2, h3, h4, h5, h6 {
+            margin-top: 2rem;
+            margin-bottom: 1rem;
+            line-height: 1.3;
+        }
+
+        code {
+            background: var(--border-color);
+            padding: 0.2rem 0.4rem;
+            border-radius: 3px;
+            font-size: 0.9em;
+            font-family: 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+        }
+
+        pre {
+            background: var(--border-color);
+            padding: 1rem;
+            border-radius: 4px;
+            overflow-x: auto;
+            margin: 1.5rem 0;
+        }
+
+        pre code {
+            background: none;
+            padding: 0;
+            border-radius: 0;
+        }
+
+        img {
+            max-width: 100%;
+            height: auto;
+            border-radius: 4px;
+            margin: 1.5rem 0;
+        }
+
+        .meta {
+            color: var(--text-color);
+            opacity: 0.8;
+            font-size: 0.9em;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+        }
+
+        .tags {
+            margin-top: 2rem;
+            padding-top: 1rem;
+            border-top: 1px solid var(--border-color);
+        }
+
+        .tags a {
+            display: inline-block;
+            background: var(--border-color);
+            color: var(--text-color);
+            padding: 0.2rem 0.6rem;
+            border-radius: 3px;
+            text-decoration: none;
+            font-size: 0.9em;
+            margin-right: 0.5rem;
+            margin-bottom: 0.5rem;
+        }
+
+        .tags a:hover {
+            background: var(--accent-color);
+            color: white;
+        }
+
+        table {
+            width: 100%;
+            border-collapse: collapse;
+            margin: 1.5rem 0;
+        }
+
+        th, td {
+            padding: 0.75rem;
+            border: 1px solid var(--border-color);
+        }
+
+        th {
+            background: var(--border-color);
+        }
+
+        blockquote {
+            margin: 1.5rem 0;
+            padding-left: 1rem;
+            border-left: 4px solid var(--accent-color);
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+    </style>
+</head>
+<body>
+    <nav>
+        <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
+    </nav>
+    <main>
+        <div class="breadcrumbs">
+            <a href="/index.html">Home</a> » Category: Algorithm Analysis
+        </div>
+        <h1>Category: Algorithm Analysis</h1>
+        <div class="meta">
+            <span>Last modified: 2025-01-01</span>
+            
+        </div>
+        <div class="content">
+            <h2>Category: Algorithm Analysis</h2>
+<ul>
+<li><a href="/algorithms/greedy-algorithms.html">Greedy Algorithms for Interval Scheduling and Partitioning</a></li></ul>
+        </div>
+        
+    </main>
+</body>
+</html>
\ No newline at end of file
diff --git a/site/categories/algorithms.html b/site/categories/algorithms.html
new file mode 100644
index 0000000..5473478
--- /dev/null
+++ b/site/categories/algorithms.html
@@ -0,0 +1,198 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Category: algorithms</title>
+    <meta name="description" content="Pages in category algorithms">
+    <style>
+        :root {
+            --text-color: #2c3e50;
+            --background-color: #ffffff;
+            --accent-color: #3498db;
+            --border-color: #ecf0f1;
+            --nav-background: rgba(255, 255, 255, 0.9);
+        }
+
+        @media (prefers-color-scheme: dark) {
+            :root {
+                --text-color: #ecf0f1;
+                --background-color: #2c3e50;
+                --accent-color: #3498db;
+                --border-color: #34495e;
+                --nav-background: rgba(44, 62, 80, 0.9);
+            }
+        }
+
+        body {
+            font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            line-height: 1.6;
+            max-width: 50rem;
+            margin: 0 auto;
+            padding: 2rem;
+            color: var(--text-color);
+            background: var(--background-color);
+        }
+
+        nav {
+            position: sticky;
+            top: 0;
+            background: var(--nav-background);
+            backdrop-filter: blur(10px);
+            border-bottom: 1px solid var(--border-color);
+            padding: 1rem 0;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+            z-index: 1000;
+        }
+
+        nav a {
+            color: var(--accent-color);
+            text-decoration: none;
+            padding: 0.5rem 1rem;
+            border-radius: 4px;
+            transition: background-color 0.2s;
+        }
+
+        nav a:hover {
+            background-color: var(--border-color);
+        }
+
+        .breadcrumbs {
+            margin-bottom: 2rem;
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+
+        .breadcrumbs a {
+            color: var(--accent-color);
+            text-decoration: none;
+        }
+
+        .content {
+            margin-top: 2rem;
+        }
+
+        h1, h2, h3, h4, h5, h6 {
+            margin-top: 2rem;
+            margin-bottom: 1rem;
+            line-height: 1.3;
+        }
+
+        code {
+            background: var(--border-color);
+            padding: 0.2rem 0.4rem;
+            border-radius: 3px;
+            font-size: 0.9em;
+            font-family: 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+        }
+
+        pre {
+            background: var(--border-color);
+            padding: 1rem;
+            border-radius: 4px;
+            overflow-x: auto;
+            margin: 1.5rem 0;
+        }
+
+        pre code {
+            background: none;
+            padding: 0;
+            border-radius: 0;
+        }
+
+        img {
+            max-width: 100%;
+            height: auto;
+            border-radius: 4px;
+            margin: 1.5rem 0;
+        }
+
+        .meta {
+            color: var(--text-color);
+            opacity: 0.8;
+            font-size: 0.9em;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+        }
+
+        .tags {
+            margin-top: 2rem;
+            padding-top: 1rem;
+            border-top: 1px solid var(--border-color);
+        }
+
+        .tags a {
+            display: inline-block;
+            background: var(--border-color);
+            color: var(--text-color);
+            padding: 0.2rem 0.6rem;
+            border-radius: 3px;
+            text-decoration: none;
+            font-size: 0.9em;
+            margin-right: 0.5rem;
+            margin-bottom: 0.5rem;
+        }
+
+        .tags a:hover {
+            background: var(--accent-color);
+            color: white;
+        }
+
+        table {
+            width: 100%;
+            border-collapse: collapse;
+            margin: 1.5rem 0;
+        }
+
+        th, td {
+            padding: 0.75rem;
+            border: 1px solid var(--border-color);
+        }
+
+        th {
+            background: var(--border-color);
+        }
+
+        blockquote {
+            margin: 1.5rem 0;
+            padding-left: 1rem;
+            border-left: 4px solid var(--accent-color);
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+    </style>
+</head>
+<body>
+    <nav>
+        <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
+    </nav>
+    <main>
+        <div class="breadcrumbs">
+            <a href="/index.html">Home</a> » Category: algorithms
+        </div>
+        <h1>Category: algorithms</h1>
+        <div class="meta">
+            <span>Last modified: 2025-01-01</span>
+            
+        </div>
+        <div class="content">
+            <h2>Category: algorithms</h2>
+<ul>
+<li><a href="/algorithms/approximation-algorithms.html">Approximation Algorithms</a></li>
+<li><a href="/algorithms/BFS.html">Breadth First Search Algorithm Implementation and Analysis</a></li>
+<li><a href="/algorithms/DFS.html">Depth First Search Algorithm and Tree Properties</a></li>
+<li><a href="/algorithms/divide-and-conquer.html">Divide and Conquer Algorithm Analysis with Implementation Examples</a></li>
+<li><a href="/algorithms/dynamic-programming.html">Dynamic Programming Algorithms and Problem Solutions Guide</a></li>
+<li><a href="/algorithms/connected-components.html">Finding Connected Components in Undirected Graphs Using BFS/DFS</a></li>
+<li><a href="/algorithms/DAGs.html">Topological Ordering and Properties of Directed Acyclic Graphs</a></li></ul>
+        </div>
+        
+    </main>
+</body>
+</html>
\ No newline at end of file
diff --git a/site/categories/computer science.html b/site/categories/computer science.html
new file mode 100644
index 0000000..a9c5e51
--- /dev/null
+++ b/site/categories/computer science.html	
@@ -0,0 +1,192 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Category: Computer Science</title>
+    <meta name="description" content="Pages in category Computer Science">
+    <style>
+        :root {
+            --text-color: #2c3e50;
+            --background-color: #ffffff;
+            --accent-color: #3498db;
+            --border-color: #ecf0f1;
+            --nav-background: rgba(255, 255, 255, 0.9);
+        }
+
+        @media (prefers-color-scheme: dark) {
+            :root {
+                --text-color: #ecf0f1;
+                --background-color: #2c3e50;
+                --accent-color: #3498db;
+                --border-color: #34495e;
+                --nav-background: rgba(44, 62, 80, 0.9);
+            }
+        }
+
+        body {
+            font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            line-height: 1.6;
+            max-width: 50rem;
+            margin: 0 auto;
+            padding: 2rem;
+            color: var(--text-color);
+            background: var(--background-color);
+        }
+
+        nav {
+            position: sticky;
+            top: 0;
+            background: var(--nav-background);
+            backdrop-filter: blur(10px);
+            border-bottom: 1px solid var(--border-color);
+            padding: 1rem 0;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+            z-index: 1000;
+        }
+
+        nav a {
+            color: var(--accent-color);
+            text-decoration: none;
+            padding: 0.5rem 1rem;
+            border-radius: 4px;
+            transition: background-color 0.2s;
+        }
+
+        nav a:hover {
+            background-color: var(--border-color);
+        }
+
+        .breadcrumbs {
+            margin-bottom: 2rem;
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+
+        .breadcrumbs a {
+            color: var(--accent-color);
+            text-decoration: none;
+        }
+
+        .content {
+            margin-top: 2rem;
+        }
+
+        h1, h2, h3, h4, h5, h6 {
+            margin-top: 2rem;
+            margin-bottom: 1rem;
+            line-height: 1.3;
+        }
+
+        code {
+            background: var(--border-color);
+            padding: 0.2rem 0.4rem;
+            border-radius: 3px;
+            font-size: 0.9em;
+            font-family: 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+        }
+
+        pre {
+            background: var(--border-color);
+            padding: 1rem;
+            border-radius: 4px;
+            overflow-x: auto;
+            margin: 1.5rem 0;
+        }
+
+        pre code {
+            background: none;
+            padding: 0;
+            border-radius: 0;
+        }
+
+        img {
+            max-width: 100%;
+            height: auto;
+            border-radius: 4px;
+            margin: 1.5rem 0;
+        }
+
+        .meta {
+            color: var(--text-color);
+            opacity: 0.8;
+            font-size: 0.9em;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+        }
+
+        .tags {
+            margin-top: 2rem;
+            padding-top: 1rem;
+            border-top: 1px solid var(--border-color);
+        }
+
+        .tags a {
+            display: inline-block;
+            background: var(--border-color);
+            color: var(--text-color);
+            padding: 0.2rem 0.6rem;
+            border-radius: 3px;
+            text-decoration: none;
+            font-size: 0.9em;
+            margin-right: 0.5rem;
+            margin-bottom: 0.5rem;
+        }
+
+        .tags a:hover {
+            background: var(--accent-color);
+            color: white;
+        }
+
+        table {
+            width: 100%;
+            border-collapse: collapse;
+            margin: 1.5rem 0;
+        }
+
+        th, td {
+            padding: 0.75rem;
+            border: 1px solid var(--border-color);
+        }
+
+        th {
+            background: var(--border-color);
+        }
+
+        blockquote {
+            margin: 1.5rem 0;
+            padding-left: 1rem;
+            border-left: 4px solid var(--accent-color);
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+    </style>
+</head>
+<body>
+    <nav>
+        <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
+    </nav>
+    <main>
+        <div class="breadcrumbs">
+            <a href="/index.html">Home</a> » Category: Computer Science
+        </div>
+        <h1>Category: Computer Science</h1>
+        <div class="meta">
+            <span>Last modified: 2025-01-01</span>
+            
+        </div>
+        <div class="content">
+            <h2>Category: Computer Science</h2>
+<ul>
+<li><a href="/algorithms/runtime.html">Measuring Algorithm Efficiency with Asymptotic Notation</a></li></ul>
+        </div>
+        
+    </main>
+</body>
+</html>
\ No newline at end of file
diff --git a/site/categories/graph theory.html b/site/categories/graph theory.html
new file mode 100644
index 0000000..9505e28
--- /dev/null
+++ b/site/categories/graph theory.html	
@@ -0,0 +1,195 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Category: Graph Theory</title>
+    <meta name="description" content="Pages in category Graph Theory">
+    <style>
+        :root {
+            --text-color: #2c3e50;
+            --background-color: #ffffff;
+            --accent-color: #3498db;
+            --border-color: #ecf0f1;
+            --nav-background: rgba(255, 255, 255, 0.9);
+        }
+
+        @media (prefers-color-scheme: dark) {
+            :root {
+                --text-color: #ecf0f1;
+                --background-color: #2c3e50;
+                --accent-color: #3498db;
+                --border-color: #34495e;
+                --nav-background: rgba(44, 62, 80, 0.9);
+            }
+        }
+
+        body {
+            font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            line-height: 1.6;
+            max-width: 50rem;
+            margin: 0 auto;
+            padding: 2rem;
+            color: var(--text-color);
+            background: var(--background-color);
+        }
+
+        nav {
+            position: sticky;
+            top: 0;
+            background: var(--nav-background);
+            backdrop-filter: blur(10px);
+            border-bottom: 1px solid var(--border-color);
+            padding: 1rem 0;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+            z-index: 1000;
+        }
+
+        nav a {
+            color: var(--accent-color);
+            text-decoration: none;
+            padding: 0.5rem 1rem;
+            border-radius: 4px;
+            transition: background-color 0.2s;
+        }
+
+        nav a:hover {
+            background-color: var(--border-color);
+        }
+
+        .breadcrumbs {
+            margin-bottom: 2rem;
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+
+        .breadcrumbs a {
+            color: var(--accent-color);
+            text-decoration: none;
+        }
+
+        .content {
+            margin-top: 2rem;
+        }
+
+        h1, h2, h3, h4, h5, h6 {
+            margin-top: 2rem;
+            margin-bottom: 1rem;
+            line-height: 1.3;
+        }
+
+        code {
+            background: var(--border-color);
+            padding: 0.2rem 0.4rem;
+            border-radius: 3px;
+            font-size: 0.9em;
+            font-family: 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+        }
+
+        pre {
+            background: var(--border-color);
+            padding: 1rem;
+            border-radius: 4px;
+            overflow-x: auto;
+            margin: 1.5rem 0;
+        }
+
+        pre code {
+            background: none;
+            padding: 0;
+            border-radius: 0;
+        }
+
+        img {
+            max-width: 100%;
+            height: auto;
+            border-radius: 4px;
+            margin: 1.5rem 0;
+        }
+
+        .meta {
+            color: var(--text-color);
+            opacity: 0.8;
+            font-size: 0.9em;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+        }
+
+        .tags {
+            margin-top: 2rem;
+            padding-top: 1rem;
+            border-top: 1px solid var(--border-color);
+        }
+
+        .tags a {
+            display: inline-block;
+            background: var(--border-color);
+            color: var(--text-color);
+            padding: 0.2rem 0.6rem;
+            border-radius: 3px;
+            text-decoration: none;
+            font-size: 0.9em;
+            margin-right: 0.5rem;
+            margin-bottom: 0.5rem;
+        }
+
+        .tags a:hover {
+            background: var(--accent-color);
+            color: white;
+        }
+
+        table {
+            width: 100%;
+            border-collapse: collapse;
+            margin: 1.5rem 0;
+        }
+
+        th, td {
+            padding: 0.75rem;
+            border: 1px solid var(--border-color);
+        }
+
+        th {
+            background: var(--border-color);
+        }
+
+        blockquote {
+            margin: 1.5rem 0;
+            padding-left: 1rem;
+            border-left: 4px solid var(--accent-color);
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+    </style>
+</head>
+<body>
+    <nav>
+        <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
+    </nav>
+    <main>
+        <div class="breadcrumbs">
+            <a href="/index.html">Home</a> » Category: Graph Theory
+        </div>
+        <h1>Category: Graph Theory</h1>
+        <div class="meta">
+            <span>Last modified: 2025-01-01</span>
+            
+        </div>
+        <div class="content">
+            <h2>Category: Graph Theory</h2>
+<ul>
+<li><a href="/algorithms/bipartite-graphs.html">Bipartite Graphs Properties, Proofs, and Detection Algorithm</a></li>
+<li><a href="/algorithms/graphs-intro.html">Introduction to Undirected Graphs and Their Properties</a></li>
+<li><a href="/algorithms/network-flows.html">Network Flow Algorithms and Applications in Graph Theory</a></li>
+<li><a href="/algorithms/tree-intro.html">Tree Properties and Proof of Edge Count</a></li></ul>
+        </div>
+        
+    </main>
+</body>
+</html>
\ No newline at end of file
diff --git a/site/categories/index.html b/site/categories/index.html
new file mode 100644
index 0000000..4d8f3a4
--- /dev/null
+++ b/site/categories/index.html
@@ -0,0 +1,196 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Categories</title>
+    <meta name="description" content="Index of all categories">
+    <style>
+        :root {
+            --text-color: #2c3e50;
+            --background-color: #ffffff;
+            --accent-color: #3498db;
+            --border-color: #ecf0f1;
+            --nav-background: rgba(255, 255, 255, 0.9);
+        }
+
+        @media (prefers-color-scheme: dark) {
+            :root {
+                --text-color: #ecf0f1;
+                --background-color: #2c3e50;
+                --accent-color: #3498db;
+                --border-color: #34495e;
+                --nav-background: rgba(44, 62, 80, 0.9);
+            }
+        }
+
+        body {
+            font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            line-height: 1.6;
+            max-width: 50rem;
+            margin: 0 auto;
+            padding: 2rem;
+            color: var(--text-color);
+            background: var(--background-color);
+        }
+
+        nav {
+            position: sticky;
+            top: 0;
+            background: var(--nav-background);
+            backdrop-filter: blur(10px);
+            border-bottom: 1px solid var(--border-color);
+            padding: 1rem 0;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+            z-index: 1000;
+        }
+
+        nav a {
+            color: var(--accent-color);
+            text-decoration: none;
+            padding: 0.5rem 1rem;
+            border-radius: 4px;
+            transition: background-color 0.2s;
+        }
+
+        nav a:hover {
+            background-color: var(--border-color);
+        }
+
+        .breadcrumbs {
+            margin-bottom: 2rem;
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+
+        .breadcrumbs a {
+            color: var(--accent-color);
+            text-decoration: none;
+        }
+
+        .content {
+            margin-top: 2rem;
+        }
+
+        h1, h2, h3, h4, h5, h6 {
+            margin-top: 2rem;
+            margin-bottom: 1rem;
+            line-height: 1.3;
+        }
+
+        code {
+            background: var(--border-color);
+            padding: 0.2rem 0.4rem;
+            border-radius: 3px;
+            font-size: 0.9em;
+            font-family: 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+        }
+
+        pre {
+            background: var(--border-color);
+            padding: 1rem;
+            border-radius: 4px;
+            overflow-x: auto;
+            margin: 1.5rem 0;
+        }
+
+        pre code {
+            background: none;
+            padding: 0;
+            border-radius: 0;
+        }
+
+        img {
+            max-width: 100%;
+            height: auto;
+            border-radius: 4px;
+            margin: 1.5rem 0;
+        }
+
+        .meta {
+            color: var(--text-color);
+            opacity: 0.8;
+            font-size: 0.9em;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+        }
+
+        .tags {
+            margin-top: 2rem;
+            padding-top: 1rem;
+            border-top: 1px solid var(--border-color);
+        }
+
+        .tags a {
+            display: inline-block;
+            background: var(--border-color);
+            color: var(--text-color);
+            padding: 0.2rem 0.6rem;
+            border-radius: 3px;
+            text-decoration: none;
+            font-size: 0.9em;
+            margin-right: 0.5rem;
+            margin-bottom: 0.5rem;
+        }
+
+        .tags a:hover {
+            background: var(--accent-color);
+            color: white;
+        }
+
+        table {
+            width: 100%;
+            border-collapse: collapse;
+            margin: 1.5rem 0;
+        }
+
+        th, td {
+            padding: 0.75rem;
+            border: 1px solid var(--border-color);
+        }
+
+        th {
+            background: var(--border-color);
+        }
+
+        blockquote {
+            margin: 1.5rem 0;
+            padding-left: 1rem;
+            border-left: 4px solid var(--accent-color);
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+    </style>
+</head>
+<body>
+    <nav>
+        <a href="/categories/index.html">Categories</a>
+    </nav>
+    <main>
+        <div class="breadcrumbs">
+            <a href="/index.html">Home</a>
+        </div>
+        <h1>Categories</h1>
+        <div class="meta">
+            <span>Last modified: 2025-01-01</span>
+            
+        </div>
+        <div class="content">
+            <h2>Categories</h2>
+<ul>
+<li><a href="/categories/algorithm%20analysis.html">Algorithm Analysis</a> (1 pages)</li>
+<li><a href="/categories/computer%20science.html">Computer Science</a> (1 pages)</li>
+<li><a href="/categories/graph%20theory.html">Graph Theory</a> (4 pages)</li>
+<li><a href="/categories/mathematics.html">Mathematics</a> (1 pages)</li>
+<li><a href="/categories/operations%20research.html">Operations Research</a> (1 pages)</li>
+<li><a href="/categories/algorithms.html">algorithms</a> (7 pages)</li></ul>
+        </div>
+        
+    </main>
+</body>
+</html>
\ No newline at end of file
diff --git a/site/algorithms/tmp.html b/site/categories/mathematics.html
similarity index 90%
rename from site/algorithms/tmp.html
rename to site/categories/mathematics.html
index 3f30ed6..9928077 100644
--- a/site/algorithms/tmp.html
+++ b/site/categories/mathematics.html
@@ -3,8 +3,8 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Tmp</title>
-    
+    <title>Category: Mathematics</title>
+    <meta name="description" content="Pages in category Mathematics">
     <style>
         :root {
             --text-color: #2c3e50;
@@ -170,21 +170,21 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
-            <a href="/index.html">Home</a> » Tmp
+            <a href="/index.html">Home</a> » Category: Mathematics
         </div>
-        <h1>Tmp</h1>
+        <h1>Category: Mathematics</h1>
         <div class="meta">
-            <span>Last modified: 2024-05-21</span>
+            <span>Last modified: 2025-01-01</span>
             
         </div>
         <div class="content">
-            <h1 id="1">1</h1>
-<p>The knights have a bipartite coloring</p>
-<p>Each vertex is a square, and there are edges between two vertices</p>
-<p>Independent set problem: find the largest set of vertices such that no two vertices are connected by an edge</p>
+            <h2>Category: Mathematics</h2>
+<ul>
+<li><a href="/algorithms/induction.html">Mathematical Induction and Pigeonhole Principle Proofs</a></li></ul>
         </div>
         
     </main>
diff --git a/site/categories/operations research.html b/site/categories/operations research.html
new file mode 100644
index 0000000..d746d9f
--- /dev/null
+++ b/site/categories/operations research.html	
@@ -0,0 +1,192 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Category: Operations Research</title>
+    <meta name="description" content="Pages in category Operations Research">
+    <style>
+        :root {
+            --text-color: #2c3e50;
+            --background-color: #ffffff;
+            --accent-color: #3498db;
+            --border-color: #ecf0f1;
+            --nav-background: rgba(255, 255, 255, 0.9);
+        }
+
+        @media (prefers-color-scheme: dark) {
+            :root {
+                --text-color: #ecf0f1;
+                --background-color: #2c3e50;
+                --accent-color: #3498db;
+                --border-color: #34495e;
+                --nav-background: rgba(44, 62, 80, 0.9);
+            }
+        }
+
+        body {
+            font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            line-height: 1.6;
+            max-width: 50rem;
+            margin: 0 auto;
+            padding: 2rem;
+            color: var(--text-color);
+            background: var(--background-color);
+        }
+
+        nav {
+            position: sticky;
+            top: 0;
+            background: var(--nav-background);
+            backdrop-filter: blur(10px);
+            border-bottom: 1px solid var(--border-color);
+            padding: 1rem 0;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+            z-index: 1000;
+        }
+
+        nav a {
+            color: var(--accent-color);
+            text-decoration: none;
+            padding: 0.5rem 1rem;
+            border-radius: 4px;
+            transition: background-color 0.2s;
+        }
+
+        nav a:hover {
+            background-color: var(--border-color);
+        }
+
+        .breadcrumbs {
+            margin-bottom: 2rem;
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+
+        .breadcrumbs a {
+            color: var(--accent-color);
+            text-decoration: none;
+        }
+
+        .content {
+            margin-top: 2rem;
+        }
+
+        h1, h2, h3, h4, h5, h6 {
+            margin-top: 2rem;
+            margin-bottom: 1rem;
+            line-height: 1.3;
+        }
+
+        code {
+            background: var(--border-color);
+            padding: 0.2rem 0.4rem;
+            border-radius: 3px;
+            font-size: 0.9em;
+            font-family: 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+        }
+
+        pre {
+            background: var(--border-color);
+            padding: 1rem;
+            border-radius: 4px;
+            overflow-x: auto;
+            margin: 1.5rem 0;
+        }
+
+        pre code {
+            background: none;
+            padding: 0;
+            border-radius: 0;
+        }
+
+        img {
+            max-width: 100%;
+            height: auto;
+            border-radius: 4px;
+            margin: 1.5rem 0;
+        }
+
+        .meta {
+            color: var(--text-color);
+            opacity: 0.8;
+            font-size: 0.9em;
+            margin-bottom: 2rem;
+            display: flex;
+            flex-wrap: wrap;
+            gap: 1rem;
+        }
+
+        .tags {
+            margin-top: 2rem;
+            padding-top: 1rem;
+            border-top: 1px solid var(--border-color);
+        }
+
+        .tags a {
+            display: inline-block;
+            background: var(--border-color);
+            color: var(--text-color);
+            padding: 0.2rem 0.6rem;
+            border-radius: 3px;
+            text-decoration: none;
+            font-size: 0.9em;
+            margin-right: 0.5rem;
+            margin-bottom: 0.5rem;
+        }
+
+        .tags a:hover {
+            background: var(--accent-color);
+            color: white;
+        }
+
+        table {
+            width: 100%;
+            border-collapse: collapse;
+            margin: 1.5rem 0;
+        }
+
+        th, td {
+            padding: 0.75rem;
+            border: 1px solid var(--border-color);
+        }
+
+        th {
+            background: var(--border-color);
+        }
+
+        blockquote {
+            margin: 1.5rem 0;
+            padding-left: 1rem;
+            border-left: 4px solid var(--accent-color);
+            color: var(--text-color);
+            opacity: 0.8;
+        }
+    </style>
+</head>
+<body>
+    <nav>
+        <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
+    </nav>
+    <main>
+        <div class="breadcrumbs">
+            <a href="/index.html">Home</a> » Category: Operations Research
+        </div>
+        <h1>Category: Operations Research</h1>
+        <div class="meta">
+            <span>Last modified: 2025-01-01</span>
+            
+        </div>
+        <div class="content">
+            <h2>Category: Operations Research</h2>
+<ul>
+<li><a href="/algorithms/linear-programming.html">Linear Programming Fundamentals and Applications in Optimization</a></li></ul>
+        </div>
+        
+    </main>
+</body>
+</html>
\ No newline at end of file
diff --git a/site/cheatsheets/algorithms/divide-and-conquer.html b/site/cheatsheets/algorithms/divide-and-conquer.html
index ff2d5c4..72586ac 100644
--- a/site/cheatsheets/algorithms/divide-and-conquer.html
+++ b/site/cheatsheets/algorithms/divide-and-conquer.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/cheatsheets/algorithms/graphs.html b/site/cheatsheets/algorithms/graphs.html
index 7a8596b..87c7896 100644
--- a/site/cheatsheets/algorithms/graphs.html
+++ b/site/cheatsheets/algorithms/graphs.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/cheatsheets/algorithms/intervals.html b/site/cheatsheets/algorithms/intervals.html
index 6768bc8..df220c4 100644
--- a/site/cheatsheets/algorithms/intervals.html
+++ b/site/cheatsheets/algorithms/intervals.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/cheatsheets/circuits/components.html b/site/cheatsheets/circuits/components.html
index d04af14..f90216f 100644
--- a/site/cheatsheets/circuits/components.html
+++ b/site/cheatsheets/circuits/components.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/cheatsheets/circuits/electricity.html b/site/cheatsheets/circuits/electricity.html
index a54cd69..4573032 100644
--- a/site/cheatsheets/circuits/electricity.html
+++ b/site/cheatsheets/circuits/electricity.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/cheatsheets/java-spring-boot/reference.html b/site/cheatsheets/java-spring-boot/reference.html
index 4dfe5e1..79a4edc 100644
--- a/site/cheatsheets/java-spring-boot/reference.html
+++ b/site/cheatsheets/java-spring-boot/reference.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/cheatsheets/java-spring-boot/running.html b/site/cheatsheets/java-spring-boot/running.html
index 7ea23d4..e271a34 100644
--- a/site/cheatsheets/java-spring-boot/running.html
+++ b/site/cheatsheets/java-spring-boot/running.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch1-reliable-scalable-and-maintainable-applications.html b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch1-reliable-scalable-and-maintainable-applications.html
index 29dd882..943d64b 100644
--- a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch1-reliable-scalable-and-maintainable-applications.html
+++ b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch1-reliable-scalable-and-maintainable-applications.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch2-data-models-and-query-languages.html b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch2-data-models-and-query-languages.html
index 49b0a77..cceb055 100644
--- a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch2-data-models-and-query-languages.html
+++ b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch2-data-models-and-query-languages.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch3-storage-and-retrieval.html b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch3-storage-and-retrieval.html
index 4b52f7c..b8c3d49 100644
--- a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch3-storage-and-retrieval.html
+++ b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch3-storage-and-retrieval.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch4-encoding-and-evolution.html b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch4-encoding-and-evolution.html
index b814907..e146d9f 100644
--- a/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch4-encoding-and-evolution.html
+++ b/site/designing-data-intensive-applications/part-1-foundations-of-data-systems/ch4-encoding-and-evolution.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-2-distributed-data/ch5-replication.html b/site/designing-data-intensive-applications/part-2-distributed-data/ch5-replication.html
index e77c0e8..c7e398e 100644
--- a/site/designing-data-intensive-applications/part-2-distributed-data/ch5-replication.html
+++ b/site/designing-data-intensive-applications/part-2-distributed-data/ch5-replication.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-2-distributed-data/preface.html b/site/designing-data-intensive-applications/part-2-distributed-data/preface.html
index a84e245..06ee9f1 100644
--- a/site/designing-data-intensive-applications/part-2-distributed-data/preface.html
+++ b/site/designing-data-intensive-applications/part-2-distributed-data/preface.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/designing-data-intensive-applications/part-3-derived-data/ch10-batch-processing.html b/site/designing-data-intensive-applications/part-3-derived-data/ch10-batch-processing.html
index 7aa71d5..de496c2 100644
--- a/site/designing-data-intensive-applications/part-3-derived-data/ch10-batch-processing.html
+++ b/site/designing-data-intensive-applications/part-3-derived-data/ch10-batch-processing.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/digital-design/combinational-logic.html b/site/digital-design/combinational-logic.html
index a76c3ca..a1def30 100644
--- a/site/digital-design/combinational-logic.html
+++ b/site/digital-design/combinational-logic.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/digital-design/karnaugh-maps.html b/site/digital-design/karnaugh-maps.html
index 89bfd1a..34cb33b 100644
--- a/site/digital-design/karnaugh-maps.html
+++ b/site/digital-design/karnaugh-maps.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/digital-design/quartus-workflow.html b/site/digital-design/quartus-workflow.html
index 8d0926a..a91f1f6 100644
--- a/site/digital-design/quartus-workflow.html
+++ b/site/digital-design/quartus-workflow.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/digital-design/sequential-logic.html b/site/digital-design/sequential-logic.html
index 69ce3a5..8a3f174 100644
--- a/site/digital-design/sequential-logic.html
+++ b/site/digital-design/sequential-logic.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/digital-design/system-verilog.html b/site/digital-design/system-verilog.html
index 88221e9..5298a47 100644
--- a/site/digital-design/system-verilog.html
+++ b/site/digital-design/system-verilog.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/digital-design/waveform-diagram.html b/site/digital-design/waveform-diagram.html
index af2d060..3d91b54 100644
--- a/site/digital-design/waveform-diagram.html
+++ b/site/digital-design/waveform-diagram.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/RPC.html b/site/distributed-systems/RPC.html
index be7efbf..2b223b2 100644
--- a/site/distributed-systems/RPC.html
+++ b/site/distributed-systems/RPC.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/bigtable.html b/site/distributed-systems/bigtable.html
index ec7600f..491e917 100644
--- a/site/distributed-systems/bigtable.html
+++ b/site/distributed-systems/bigtable.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/clocks.html b/site/distributed-systems/clocks.html
index 548d562..fd350e1 100644
--- a/site/distributed-systems/clocks.html
+++ b/site/distributed-systems/clocks.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/consistency.html b/site/distributed-systems/consistency.html
index 9c201eb..13e8304 100644
--- a/site/distributed-systems/consistency.html
+++ b/site/distributed-systems/consistency.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/consistent-global-state.html b/site/distributed-systems/consistent-global-state.html
index b4625d7..452498f 100644
--- a/site/distributed-systems/consistent-global-state.html
+++ b/site/distributed-systems/consistent-global-state.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/disconnected-operation.html b/site/distributed-systems/disconnected-operation.html
index 9eb32e0..3102d4d 100644
--- a/site/distributed-systems/disconnected-operation.html
+++ b/site/distributed-systems/disconnected-operation.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/distributed-cache-coherence.html b/site/distributed-systems/distributed-cache-coherence.html
index b3b486c..4282bf0 100644
--- a/site/distributed-systems/distributed-cache-coherence.html
+++ b/site/distributed-systems/distributed-cache-coherence.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/dynamo-db.html b/site/distributed-systems/dynamo-db.html
index cabd7f7..ad98193 100644
--- a/site/distributed-systems/dynamo-db.html
+++ b/site/distributed-systems/dynamo-db.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/google-file-system.html b/site/distributed-systems/google-file-system.html
index e62aa09..5d1a6e6 100644
--- a/site/distributed-systems/google-file-system.html
+++ b/site/distributed-systems/google-file-system.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/load-balancing.html b/site/distributed-systems/load-balancing.html
index 232aaf3..4b074df 100644
--- a/site/distributed-systems/load-balancing.html
+++ b/site/distributed-systems/load-balancing.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/managing-critical-state.html b/site/distributed-systems/managing-critical-state.html
index b441237..2530352 100644
--- a/site/distributed-systems/managing-critical-state.html
+++ b/site/distributed-systems/managing-critical-state.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/mutual-exclusion.html b/site/distributed-systems/mutual-exclusion.html
index 798abb3..86ee9ae 100644
--- a/site/distributed-systems/mutual-exclusion.html
+++ b/site/distributed-systems/mutual-exclusion.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/non-blocking-two-phase-commit.html b/site/distributed-systems/non-blocking-two-phase-commit.html
index 48c874d..a29d28c 100644
--- a/site/distributed-systems/non-blocking-two-phase-commit.html
+++ b/site/distributed-systems/non-blocking-two-phase-commit.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/ordering-events-in-distributed-systems.html b/site/distributed-systems/ordering-events-in-distributed-systems.html
index 581b6eb..b8a8718 100644
--- a/site/distributed-systems/ordering-events-in-distributed-systems.html
+++ b/site/distributed-systems/ordering-events-in-distributed-systems.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/paxos-architecture.html b/site/distributed-systems/paxos-architecture.html
index cf18b14..96a1acd 100644
--- a/site/distributed-systems/paxos-architecture.html
+++ b/site/distributed-systems/paxos-architecture.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/paxos-intro.html b/site/distributed-systems/paxos-intro.html
index 799addf..c859c15 100644
--- a/site/distributed-systems/paxos-intro.html
+++ b/site/distributed-systems/paxos-intro.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/paxos-made-simple.html b/site/distributed-systems/paxos-made-simple.html
index a0b0a2f..0398f45 100644
--- a/site/distributed-systems/paxos-made-simple.html
+++ b/site/distributed-systems/paxos-made-simple.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/primary-backup.html b/site/distributed-systems/primary-backup.html
index ba23cb8..3e79a21 100644
--- a/site/distributed-systems/primary-backup.html
+++ b/site/distributed-systems/primary-backup.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/scaling-web-services.html b/site/distributed-systems/scaling-web-services.html
index f68251c..dafe48f 100644
--- a/site/distributed-systems/scaling-web-services.html
+++ b/site/distributed-systems/scaling-web-services.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/sharding.html b/site/distributed-systems/sharding.html
index a7753a1..9fa3f09 100644
--- a/site/distributed-systems/sharding.html
+++ b/site/distributed-systems/sharding.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/distributed-systems/two-phase-commit.html b/site/distributed-systems/two-phase-commit.html
index cec72f0..25140f1 100644
--- a/site/distributed-systems/two-phase-commit.html
+++ b/site/distributed-systems/two-phase-commit.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/RPC.html b/site/ds-backup/RPC.html
index 3b0878e..b5f9aa1 100644
--- a/site/ds-backup/RPC.html
+++ b/site/ds-backup/RPC.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/clocks.html b/site/ds-backup/clocks.html
index dd69364..8850333 100644
--- a/site/ds-backup/clocks.html
+++ b/site/ds-backup/clocks.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/consistent-global-state.html b/site/ds-backup/consistent-global-state.html
index f2ee4be..6a57490 100644
--- a/site/ds-backup/consistent-global-state.html
+++ b/site/ds-backup/consistent-global-state.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/managing-critical-state.html b/site/ds-backup/managing-critical-state.html
index 7e18dbe..797a83e 100644
--- a/site/ds-backup/managing-critical-state.html
+++ b/site/ds-backup/managing-critical-state.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/mutual-exclusion.html b/site/ds-backup/mutual-exclusion.html
index 625b18c..5d3880b 100644
--- a/site/ds-backup/mutual-exclusion.html
+++ b/site/ds-backup/mutual-exclusion.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/ordering-events-in-distributed-systems.html b/site/ds-backup/ordering-events-in-distributed-systems.html
index 9e117f0..16c77c6 100644
--- a/site/ds-backup/ordering-events-in-distributed-systems.html
+++ b/site/ds-backup/ordering-events-in-distributed-systems.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/paxos-intro.html b/site/ds-backup/paxos-intro.html
index 22d4462..1a39dd1 100644
--- a/site/ds-backup/paxos-intro.html
+++ b/site/ds-backup/paxos-intro.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/paxos-made-simple.html b/site/ds-backup/paxos-made-simple.html
index d831a41..f8011f2 100644
--- a/site/ds-backup/paxos-made-simple.html
+++ b/site/ds-backup/paxos-made-simple.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/primary-backup.html b/site/ds-backup/primary-backup.html
index ba4b128..fd82553 100644
--- a/site/ds-backup/primary-backup.html
+++ b/site/ds-backup/primary-backup.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/ds-backup/scaling-web-services.html b/site/ds-backup/scaling-web-services.html
index a85282f..c42460b 100644
--- a/site/ds-backup/scaling-web-services.html
+++ b/site/ds-backup/scaling-web-services.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/index.html b/site/index.html
index df2505c..4d26ff9 100644
--- a/site/index.html
+++ b/site/index.html
@@ -169,7 +169,7 @@
 </head>
 <body>
     <nav>
-        
+        <a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
@@ -184,11 +184,11 @@ <h1>My Digital Garden</h1>
             
             <div class="landing-stats">
                 <div class="stat-item">
-                    <span class="stat-value">146</span>
+                    <span class="stat-value">145</span>
                     <span class="stat-label">Notes</span>
                 </div>
                 <div class="stat-item">
-                    <span class="stat-value">0</span>
+                    <span class="stat-value">6</span>
                     <span class="stat-label">Categories</span>
                 </div>
                 <div class="stat-item">
@@ -201,59 +201,83 @@ <h1>My Digital Garden</h1>
                     <h2>Recent Notes</h2>
 <ul class='recent-posts'>
                 <li>
-                    <a href="/teaching/modern-java/collections-and-records.html">Collections And Records</a>
-                    <span class="date">2024-12-08</span>
-                    
+                    <a href="/algorithms/tree-intro.html">Tree Properties and Proof of Edge Count</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Graph Theory</span>
                 </li>
                 <li>
-                    <a href="/teaching/modern-java/lambdas-and-streams.html">Lambdas And Streams</a>
-                    <span class="date">2024-12-08</span>
-                    
+                    <a href="/algorithms/runtime.html">Measuring Algorithm Efficiency with Asymptotic Notation</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Computer Science</span>
                 </li>
                 <li>
-                    <a href="/linear-algebra/python-cheatsheet.html">Python Cheatsheet</a>
-                    <span class="date">2024-12-08</span>
-                    
+                    <a href="/algorithms/network-flows.html">Network Flow Algorithms and Applications in Graph Theory</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Graph Theory</span>
                 </li>
                 <li>
-                    <a href="/performance-engineering/efficiently-implementing-state-pattern-JVM.html">Efficiently Implementing State Pattern Jvm</a>
-                    <span class="date">2024-12-08</span>
-                    
+                    <a href="/algorithms/linear-programming.html">Linear Programming Fundamentals and Applications in Optimization</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Operations Research</span>
                 </li>
                 <li>
-                    <a href="/distributed-systems/disconnected-operation.html">Disconnected Operation</a>
-                    <span class="date">2024-12-08</span>
-                    
+                    <a href="/algorithms/induction.html">Mathematical Induction and Pigeonhole Principle Proofs</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Mathematics</span>
                 </li>
                 <li>
-                    <a href="/linear-algebra/elementry-linear-algebra.html">Elementry Linear Algebra</a>
-                    <span class="date">2024-11-14</span>
-                    
+                    <a href="/algorithms/greedy-algorithms.html">Greedy Algorithms for Interval Scheduling and Partitioning</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Algorithm Analysis</span>
                 </li>
                 <li>
-                    <a href="/linear-algebra/cheatsheet.html">Cheatsheet</a>
-                    <span class="date">2024-11-09</span>
-                    
+                    <a href="/algorithms/graphs-intro.html">Introduction to Undirected Graphs and Their Properties</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">Graph Theory</span>
                 </li>
                 <li>
-                    <a href="/algorithms/linear-programming.html">Linear Programming</a>
-                    <span class="date">2024-05-25</span>
-                    
+                    <a href="/algorithms/dynamic-programming.html">Dynamic Programming Algorithms and Problem Solutions Guide</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">algorithms</span>
                 </li>
                 <li>
-                    <a href="/distributed-systems/dynamo-db.html">Dynamo Db</a>
-                    <span class="date">2024-05-24</span>
-                    
+                    <a href="/algorithms/divide-and-conquer.html">Divide and Conquer Algorithm Analysis with Implementation Examples</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">algorithms</span>
                 </li>
                 <li>
-                    <a href="/algorithms/network-flows.html">Network Flows</a>
-                    <span class="date">2024-05-24</span>
-                    
+                    <a href="/algorithms/DFS.html">Depth First Search Algorithm and Tree Properties</a>
+                    <span class="date">2025-01-01</span>
+                    <span class="category">algorithms</span>
                 </li></ul>
                 </div>
                 <div class="categories-section">
                     <h2>Categories</h2>
-<ul class='categories-list'></ul>
+<ul class='categories-list'>
+                <li>
+                    <a href="/categories/algorithm%20analysis.html">Algorithm Analysis</a>
+                    <span class="count">(1)</span>
+                </li>
+                <li>
+                    <a href="/categories/computer%20science.html">Computer Science</a>
+                    <span class="count">(1)</span>
+                </li>
+                <li>
+                    <a href="/categories/graph%20theory.html">Graph Theory</a>
+                    <span class="count">(4)</span>
+                </li>
+                <li>
+                    <a href="/categories/mathematics.html">Mathematics</a>
+                    <span class="count">(1)</span>
+                </li>
+                <li>
+                    <a href="/categories/operations%20research.html">Operations Research</a>
+                    <span class="count">(1)</span>
+                </li>
+                <li>
+                    <a href="/categories/algorithms.html">algorithms</a>
+                    <span class="count">(7)</span>
+                </li></ul>
                 </div>
                 <div class="tags-section">
                     <h2>Popular Tags</h2>
diff --git a/site/linear-algebra/cheatsheet.html b/site/linear-algebra/cheatsheet.html
index 2bd665e..616d3fe 100644
--- a/site/linear-algebra/cheatsheet.html
+++ b/site/linear-algebra/cheatsheet.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/linear-algebra/elementry-linear-algebra.html b/site/linear-algebra/elementry-linear-algebra.html
index 3e71589..ab54a49 100644
--- a/site/linear-algebra/elementry-linear-algebra.html
+++ b/site/linear-algebra/elementry-linear-algebra.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/linear-algebra/python-cheatsheet.html b/site/linear-algebra/python-cheatsheet.html
index aad886b..6313031 100644
--- a/site/linear-algebra/python-cheatsheet.html
+++ b/site/linear-algebra/python-cheatsheet.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/machine-learning-for-big-data/intro-mapreduce-spark.html b/site/machine-learning-for-big-data/intro-mapreduce-spark.html
index 7b4a3c0..a4fd842 100644
--- a/site/machine-learning-for-big-data/intro-mapreduce-spark.html
+++ b/site/machine-learning-for-big-data/intro-mapreduce-spark.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/0-foundation/1-network-components-and-protocols.html b/site/networks/0-foundation/1-network-components-and-protocols.html
index 0190207..60a828f 100644
--- a/site/networks/0-foundation/1-network-components-and-protocols.html
+++ b/site/networks/0-foundation/1-network-components-and-protocols.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/0-foundation/2-physical-layer.html b/site/networks/0-foundation/2-physical-layer.html
index 2265c63..85a014d 100644
--- a/site/networks/0-foundation/2-physical-layer.html
+++ b/site/networks/0-foundation/2-physical-layer.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/0-foundation/3-performance.html b/site/networks/0-foundation/3-performance.html
index c9d35f9..7b79ba5 100644
--- a/site/networks/0-foundation/3-performance.html
+++ b/site/networks/0-foundation/3-performance.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/0-foundation/information-theory.html b/site/networks/0-foundation/information-theory.html
index 1c0fb02..bebcdbd 100644
--- a/site/networks/0-foundation/information-theory.html
+++ b/site/networks/0-foundation/information-theory.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/1-physical/coding-and-modulation.html b/site/networks/1-physical/coding-and-modulation.html
index 19fcea3..3216ea4 100644
--- a/site/networks/1-physical/coding-and-modulation.html
+++ b/site/networks/1-physical/coding-and-modulation.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/1-physical/media.html b/site/networks/1-physical/media.html
index fbb2917..74630dd 100644
--- a/site/networks/1-physical/media.html
+++ b/site/networks/1-physical/media.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/2-direct-links/errors.html b/site/networks/2-direct-links/errors.html
index 0f374d8..93af44a 100644
--- a/site/networks/2-direct-links/errors.html
+++ b/site/networks/2-direct-links/errors.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/2-direct-links/framing.html b/site/networks/2-direct-links/framing.html
index eaf7fc8..3283edd 100644
--- a/site/networks/2-direct-links/framing.html
+++ b/site/networks/2-direct-links/framing.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/2-direct-links/multiple-access.html b/site/networks/2-direct-links/multiple-access.html
index 069eb70..a6421e8 100644
--- a/site/networks/2-direct-links/multiple-access.html
+++ b/site/networks/2-direct-links/multiple-access.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/2-direct-links/retransmission.html b/site/networks/2-direct-links/retransmission.html
index 67c5023..15b7ff2 100644
--- a/site/networks/2-direct-links/retransmission.html
+++ b/site/networks/2-direct-links/retransmission.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/2-direct-links/switching.html b/site/networks/2-direct-links/switching.html
index 42cc4b9..3c79dc8 100644
--- a/site/networks/2-direct-links/switching.html
+++ b/site/networks/2-direct-links/switching.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/2-direct-links/wireless.html b/site/networks/2-direct-links/wireless.html
index 80b3bfe..4a3cd55 100644
--- a/site/networks/2-direct-links/wireless.html
+++ b/site/networks/2-direct-links/wireless.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/ARP.html b/site/networks/3-network/ARP.html
index f501ea0..6e5c252 100644
--- a/site/networks/3-network/ARP.html
+++ b/site/networks/3-network/ARP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/BGP.html b/site/networks/3-network/BGP.html
index feaba0d..013fd06 100644
--- a/site/networks/3-network/BGP.html
+++ b/site/networks/3-network/BGP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/DHCP.html b/site/networks/3-network/DHCP.html
index 0af8e90..9eed373 100644
--- a/site/networks/3-network/DHCP.html
+++ b/site/networks/3-network/DHCP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/ICMP.html b/site/networks/3-network/ICMP.html
index a46d006..de5afa6 100644
--- a/site/networks/3-network/ICMP.html
+++ b/site/networks/3-network/ICMP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/global-internet.html b/site/networks/3-network/global-internet.html
index 58cabf3..c9bdbc6 100644
--- a/site/networks/3-network/global-internet.html
+++ b/site/networks/3-network/global-internet.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/internetworking.html b/site/networks/3-network/internetworking.html
index 35c3bc9..6fcaf76 100644
--- a/site/networks/3-network/internetworking.html
+++ b/site/networks/3-network/internetworking.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/motivation.html b/site/networks/3-network/motivation.html
index 9283c51..0f9f922 100644
--- a/site/networks/3-network/motivation.html
+++ b/site/networks/3-network/motivation.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/networking-services.html b/site/networks/3-network/networking-services.html
index 4d6afb4..6dbba68 100644
--- a/site/networks/3-network/networking-services.html
+++ b/site/networks/3-network/networking-services.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/3-network/routing.html b/site/networks/3-network/routing.html
index d43e8bb..cb0ae81 100644
--- a/site/networks/3-network/routing.html
+++ b/site/networks/3-network/routing.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/4-transport/ACK-clocking.html b/site/networks/4-transport/ACK-clocking.html
index 46b7615..d4f1ff7 100644
--- a/site/networks/4-transport/ACK-clocking.html
+++ b/site/networks/4-transport/ACK-clocking.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/4-transport/TCP.html b/site/networks/4-transport/TCP.html
index a228d41..122e2be 100644
--- a/site/networks/4-transport/TCP.html
+++ b/site/networks/4-transport/TCP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/4-transport/UDP.html b/site/networks/4-transport/UDP.html
index afb3ed9..e61b978 100644
--- a/site/networks/4-transport/UDP.html
+++ b/site/networks/4-transport/UDP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/4-transport/flow-control.html b/site/networks/4-transport/flow-control.html
index 31f2a32..bc164c4 100644
--- a/site/networks/4-transport/flow-control.html
+++ b/site/networks/4-transport/flow-control.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/4-transport/transport-overview.html b/site/networks/4-transport/transport-overview.html
index 55e4ff3..37e8554 100644
--- a/site/networks/4-transport/transport-overview.html
+++ b/site/networks/4-transport/transport-overview.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/5-application/CDNs.html b/site/networks/5-application/CDNs.html
index 68c4695..6fd44f0 100644
--- a/site/networks/5-application/CDNs.html
+++ b/site/networks/5-application/CDNs.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/5-application/DNS.html b/site/networks/5-application/DNS.html
index 09a8f40..0201f34 100644
--- a/site/networks/5-application/DNS.html
+++ b/site/networks/5-application/DNS.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/5-application/HTTP.html b/site/networks/5-application/HTTP.html
index 0cbb7a8..fd592a6 100644
--- a/site/networks/5-application/HTTP.html
+++ b/site/networks/5-application/HTTP.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/5-application/overview.html b/site/networks/5-application/overview.html
index 4062371..55c7d2f 100644
--- a/site/networks/5-application/overview.html
+++ b/site/networks/5-application/overview.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/reference.html b/site/networks/reference.html
index 5319f00..dad441c 100644
--- a/site/networks/reference.html
+++ b/site/networks/reference.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/networks/sockets.html b/site/networks/sockets.html
index d8acd92..97f2513 100644
--- a/site/networks/sockets.html
+++ b/site/networks/sockets.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/components.html b/site/operating-systems/lecture-notes/components.html
index 0c0b1a8..7815eeb 100644
--- a/site/operating-systems/lecture-notes/components.html
+++ b/site/operating-systems/lecture-notes/components.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/file-systems.html b/site/operating-systems/lecture-notes/file-systems.html
index 481b958..b64c33f 100644
--- a/site/operating-systems/lecture-notes/file-systems.html
+++ b/site/operating-systems/lecture-notes/file-systems.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/handle-tables.html b/site/operating-systems/lecture-notes/handle-tables.html
index e25e671..02fef8d 100644
--- a/site/operating-systems/lecture-notes/handle-tables.html
+++ b/site/operating-systems/lecture-notes/handle-tables.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/io-systems-secondary-storage.html b/site/operating-systems/lecture-notes/io-systems-secondary-storage.html
index 12fcd96..7e3c975 100644
--- a/site/operating-systems/lecture-notes/io-systems-secondary-storage.html
+++ b/site/operating-systems/lecture-notes/io-systems-secondary-storage.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/kernel-abstraction.html b/site/operating-systems/lecture-notes/kernel-abstraction.html
index c5dd97e..5921b32 100644
--- a/site/operating-systems/lecture-notes/kernel-abstraction.html
+++ b/site/operating-systems/lecture-notes/kernel-abstraction.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/page-faults.html b/site/operating-systems/lecture-notes/page-faults.html
index 5c60b43..0d0d7ca 100644
--- a/site/operating-systems/lecture-notes/page-faults.html
+++ b/site/operating-systems/lecture-notes/page-faults.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/paging.html b/site/operating-systems/lecture-notes/paging.html
index 9458ec2..1cf1659 100644
--- a/site/operating-systems/lecture-notes/paging.html
+++ b/site/operating-systems/lecture-notes/paging.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/processes.html b/site/operating-systems/lecture-notes/processes.html
index 08b41ca..910742a 100644
--- a/site/operating-systems/lecture-notes/processes.html
+++ b/site/operating-systems/lecture-notes/processes.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/tlb.html b/site/operating-systems/lecture-notes/tlb.html
index 42fc6c7..0af229c 100644
--- a/site/operating-systems/lecture-notes/tlb.html
+++ b/site/operating-systems/lecture-notes/tlb.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/windows-memory-management.html b/site/operating-systems/lecture-notes/windows-memory-management.html
index d9f7a7b..7b2b456 100644
--- a/site/operating-systems/lecture-notes/windows-memory-management.html
+++ b/site/operating-systems/lecture-notes/windows-memory-management.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/windows-objects-handles-refcounts.html b/site/operating-systems/lecture-notes/windows-objects-handles-refcounts.html
index 68be7dd..2bb61d1 100644
--- a/site/operating-systems/lecture-notes/windows-objects-handles-refcounts.html
+++ b/site/operating-systems/lecture-notes/windows-objects-handles-refcounts.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/lecture-notes/windows-rtz.html b/site/operating-systems/lecture-notes/windows-rtz.html
index a85cd2f..859d192 100644
--- a/site/operating-systems/lecture-notes/windows-rtz.html
+++ b/site/operating-systems/lecture-notes/windows-rtz.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/reference.html b/site/operating-systems/reference.html
index 44013f6..0f3cbd2 100644
--- a/site/operating-systems/reference.html
+++ b/site/operating-systems/reference.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/section-notes/lab-3-questions.html b/site/operating-systems/section-notes/lab-3-questions.html
index eb8644e..82643f4 100644
--- a/site/operating-systems/section-notes/lab-3-questions.html
+++ b/site/operating-systems/section-notes/lab-3-questions.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/section-notes/section-1.html b/site/operating-systems/section-notes/section-1.html
index 7656f4d..44b3075 100644
--- a/site/operating-systems/section-notes/section-1.html
+++ b/site/operating-systems/section-notes/section-1.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v1-kernels-and-processes/1-introductions.html b/site/operating-systems/v1-kernels-and-processes/1-introductions.html
index 9a2b8d3..cc1de48 100644
--- a/site/operating-systems/v1-kernels-and-processes/1-introductions.html
+++ b/site/operating-systems/v1-kernels-and-processes/1-introductions.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v1-kernels-and-processes/2-the-kernel-abstraction.html b/site/operating-systems/v1-kernels-and-processes/2-the-kernel-abstraction.html
index d3b47d0..8ce7ee1 100644
--- a/site/operating-systems/v1-kernels-and-processes/2-the-kernel-abstraction.html
+++ b/site/operating-systems/v1-kernels-and-processes/2-the-kernel-abstraction.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v1-kernels-and-processes/3-the-programming-interface.html b/site/operating-systems/v1-kernels-and-processes/3-the-programming-interface.html
index 562dff6..84011f5 100644
--- a/site/operating-systems/v1-kernels-and-processes/3-the-programming-interface.html
+++ b/site/operating-systems/v1-kernels-and-processes/3-the-programming-interface.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v2-concurrency/4-concurrency-and-threads.html b/site/operating-systems/v2-concurrency/4-concurrency-and-threads.html
index 9aec931..cb3b47c 100644
--- a/site/operating-systems/v2-concurrency/4-concurrency-and-threads.html
+++ b/site/operating-systems/v2-concurrency/4-concurrency-and-threads.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v2-concurrency/5-synchronizing-access-to-shared-objects.html b/site/operating-systems/v2-concurrency/5-synchronizing-access-to-shared-objects.html
index 5c3d2a0..4865256 100644
--- a/site/operating-systems/v2-concurrency/5-synchronizing-access-to-shared-objects.html
+++ b/site/operating-systems/v2-concurrency/5-synchronizing-access-to-shared-objects.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v2-concurrency/7-multiprocessor-scheduling.html b/site/operating-systems/v2-concurrency/7-multiprocessor-scheduling.html
index 7bcb3ad..b4adff4 100644
--- a/site/operating-systems/v2-concurrency/7-multiprocessor-scheduling.html
+++ b/site/operating-systems/v2-concurrency/7-multiprocessor-scheduling.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v2-concurrency/7-queueing-theory.html b/site/operating-systems/v2-concurrency/7-queueing-theory.html
index aa1c448..57799ce 100644
--- a/site/operating-systems/v2-concurrency/7-queueing-theory.html
+++ b/site/operating-systems/v2-concurrency/7-queueing-theory.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v2-concurrency/7-uniprocessor-scheduling.html b/site/operating-systems/v2-concurrency/7-uniprocessor-scheduling.html
index d8e1770..31d1c43 100644
--- a/site/operating-systems/v2-concurrency/7-uniprocessor-scheduling.html
+++ b/site/operating-systems/v2-concurrency/7-uniprocessor-scheduling.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v4-persistent-storage/11-file-systems-overview.html b/site/operating-systems/v4-persistent-storage/11-file-systems-overview.html
index 045d6ee..8060a54 100644
--- a/site/operating-systems/v4-persistent-storage/11-file-systems-overview.html
+++ b/site/operating-systems/v4-persistent-storage/11-file-systems-overview.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/operating-systems/v4-persistent-storage/13-files-and-directories.html b/site/operating-systems/v4-persistent-storage/13-files-and-directories.html
index e80ae2f..1196cb0 100644
--- a/site/operating-systems/v4-persistent-storage/13-files-and-directories.html
+++ b/site/operating-systems/v4-persistent-storage/13-files-and-directories.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/performance-engineering/efficiently-implementing-state-pattern-JVM.html b/site/performance-engineering/efficiently-implementing-state-pattern-JVM.html
index a3be93a..953f1c5 100644
--- a/site/performance-engineering/efficiently-implementing-state-pattern-JVM.html
+++ b/site/performance-engineering/efficiently-implementing-state-pattern-JVM.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/scripts/simple.html b/site/scripts/simple.html
index 50ba0d0..7bbac1f 100644
--- a/site/scripts/simple.html
+++ b/site/scripts/simple.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/signal-conditioning/lecture-notes/lecture-1.html b/site/signal-conditioning/lecture-notes/lecture-1.html
index aa7ba62..4fca66c 100644
--- a/site/signal-conditioning/lecture-notes/lecture-1.html
+++ b/site/signal-conditioning/lecture-notes/lecture-1.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/signal-conditioning/lecture-notes/lecture-2.html b/site/signal-conditioning/lecture-notes/lecture-2.html
index 2cd5c31..62975cc 100644
--- a/site/signal-conditioning/lecture-notes/lecture-2.html
+++ b/site/signal-conditioning/lecture-notes/lecture-2.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/signal-conditioning/lecture-notes/lecture-3.html b/site/signal-conditioning/lecture-notes/lecture-3.html
index 4ef51d2..4bb4563 100644
--- a/site/signal-conditioning/lecture-notes/lecture-3.html
+++ b/site/signal-conditioning/lecture-notes/lecture-3.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/signal-conditioning/lecture-notes/lecture-4.html b/site/signal-conditioning/lecture-notes/lecture-4.html
index c620d64..3339f0a 100644
--- a/site/signal-conditioning/lecture-notes/lecture-4.html
+++ b/site/signal-conditioning/lecture-notes/lecture-4.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/signal-conditioning/lecture-notes/lecture-5.html b/site/signal-conditioning/lecture-notes/lecture-5.html
index b5decb0..8ce5ef2 100644
--- a/site/signal-conditioning/lecture-notes/lecture-5.html
+++ b/site/signal-conditioning/lecture-notes/lecture-5.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/signal-conditioning/lecture-notes/lecture-6.html b/site/signal-conditioning/lecture-notes/lecture-6.html
index d857627..60b09d7 100644
--- a/site/signal-conditioning/lecture-notes/lecture-6.html
+++ b/site/signal-conditioning/lecture-notes/lecture-6.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/teaching/modern-java/collections-and-records.html b/site/teaching/modern-java/collections-and-records.html
index 22eb7be..8cdb559 100644
--- a/site/teaching/modern-java/collections-and-records.html
+++ b/site/teaching/modern-java/collections-and-records.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/teaching/modern-java/lambdas-and-streams.html b/site/teaching/modern-java/lambdas-and-streams.html
index f650b3e..8d6290a 100644
--- a/site/teaching/modern-java/lambdas-and-streams.html
+++ b/site/teaching/modern-java/lambdas-and-streams.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/tmp/bench/spec.html b/site/tmp/bench/spec.html
index eb038a0..c5117c8 100644
--- a/site/tmp/bench/spec.html
+++ b/site/tmp/bench/spec.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">
diff --git a/site/tmp/pairing-algorithm.html b/site/tmp/pairing-algorithm.html
index e8b8cec..2d0d36c 100644
--- a/site/tmp/pairing-algorithm.html
+++ b/site/tmp/pairing-algorithm.html
@@ -170,6 +170,7 @@
 <body>
     <nav>
         <a href="/index.html">Home</a>
+<a href="/categories/index.html">Categories</a>
     </nav>
     <main>
         <div class="breadcrumbs">