From 8091188419dcb21866500abcb7d8ef170b937c93 Mon Sep 17 00:00:00 2001
From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Sun, 23 Mar 2025 11:55:26 -0600
Subject: [PATCH] Fix a wrong word.

---
 include/deal.II/lac/trilinos_tpetra_sparse_matrix.templates.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/include/deal.II/lac/trilinos_tpetra_sparse_matrix.templates.h b/include/deal.II/lac/trilinos_tpetra_sparse_matrix.templates.h
index a25d8195ef..946bcfe288 100644
--- a/include/deal.II/lac/trilinos_tpetra_sparse_matrix.templates.h
+++ b/include/deal.II/lac/trilinos_tpetra_sparse_matrix.templates.h
@@ -222,8 +222,8 @@ namespace LinearAlgebra
         for (size_type row = first_row; row < last_row; ++row)
           n_entries_per_row[row - first_row] = sparsity_pattern.row_length(row);
 
-        // The deal.II notation of a Sparsity pattern corresponds to the
-        // Tpetra concept of a Graph. Hence, we generate a graph by copying
+        // The deal.II notion of a 'sparsity pattern' corresponds to the
+        // Tpetra concept of a 'graph'. Hence, we generate a graph by copying
         // the sparsity pattern into it, and then build up the matrix from the
         // graph. This is considerable faster than directly filling elements
         // into the matrix. Moreover, it consumes less memory, since the
-- 
2.39.5