From e201a4d9ea30a736268bda8b4beb7c99d4fe2017 Mon Sep 17 00:00:00 2001
From: wolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Tue, 16 Apr 2002 08:35:07 +0000
Subject: [PATCH] Add step-13.

git-svn-id: https://svn.dealii.org/trunk@5657 0785d39b-7218-0410-832d-ea1e28bc413d
---
 .../chapter-2.step-by-step/navbar.html        |  6 ++++++
 .../tutorial/chapter-2.step-by-step/toc.html  | 19 ++++++++++++-------
 2 files changed, 18 insertions(+), 7 deletions(-)

diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html b/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html
index 5ba3765ae6..77768a64c8 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html
@@ -95,6 +95,12 @@
 	  <a href="step-12.html" target="body">Step 12</a>
 	</p>
       </li>
+
+      <li>
+	<p>
+	  <a href="step-13.html" target="body">Step 13</a>
+	</p>
+      </li>
     </dl>
 
 
diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html b/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html
index 1da379eb97..ae1fc2fcb6 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html
@@ -51,16 +51,16 @@ At present, the following programs exist:
 
 <dl>
       <dt><a href="step-1.html">Step 1</a></dt> 
-      <dd><strong>What's new:</strong> everything. We create a grid and show a simple
-      way to write it to a file.
+      <dd><strong>What's new:</strong> Everything. We create a grid
+      and show a simple way to write it to a file.
       </dd>
     
       <dt><a href="step-2.html">Step 2</a></dt> 
-      <dd><strong>What's new:</strong> Associate degrees of freedom to each vertex
-      and compute the resulting sparsity pattern of matrices. Show
-      that renumbering reduces the bandwidth of matrices
-      significantly, i.e. clusters nonzero entries around the
-      diagonal. 
+      <dd><strong>What's new:</strong> Associate degrees of freedom to
+      each vertex and compute the resulting sparsity pattern of
+      matrices. Show that renumbering reduces the bandwidth of
+      matrices significantly, i.e. clusters nonzero entries around the
+      diagonal.
       </dd>
 
       <dt><a href="step-3.html">Step 3</a></dt> 
@@ -128,6 +128,11 @@ At present, the following programs exist:
       <dd><strong>What's new:</strong> General framework for
       discontinuous Galerkin methods. Use of Timer class.
       </dd>
+
+      <dt><a href="step-13.html">Step 13</a></dt>
+      <dd><strong>What's new:</strong> Software design questions and
+      how to write a modular, extensible finite element program.
+      </dd>
 </dl>
 
 <!-- Page Foot -->
-- 
2.39.5