From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Sun, 29 Mar 2020 16:48:15 +0000 (-0600)
Subject: Fix broken documentation.
X-Git-Tag: v9.2.0-rc1~333^2
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=434c74255b62240ff0af46227db981dbc79632dc;p=dealii.git

Fix broken documentation.

This was apparently mangled when we ran clang-indent the first time.
---

diff --git a/include/deal.II/base/graph_coloring.h b/include/deal.II/base/graph_coloring.h
index 270e10ab60..442f25d94c 100644
--- a/include/deal.II/base/graph_coloring.h
+++ b/include/deal.II/base/graph_coloring.h
@@ -199,12 +199,15 @@ namespace GraphColoring
 
     /**
      * This function uses DSATUR (Degree SATURation) to color the elements of
-     * a set. DSATUR works as follows: -# Arrange the vertices by decreasing
-     * order of degrees. -# Color a vertex of maximal degree with color 1. -#
-     * Choose a vertex with a maximal saturation degree. If there is equality,
-     * choose any vertex of maximal degree in the uncolored subgraph. -# Color
-     * the chosen vertex with the least possible (lowest numbered) color. -#
-     * If all the vertices are colored, stop. Otherwise, return to 3.
+     * a set. DSATUR works as follows:
+     * -# Arrange the vertices by decreasing order of degrees.
+     * -# Color a vertex of maximal degree with color 1.
+     * -# Choose a vertex with a maximal saturation degree. If there is
+     *    equality, choose any vertex of maximal degree in the uncolored
+     *    subgraph.
+     * -# Color the chosen vertex with the least possible (lowest numbered)
+     *    color.
+     * -# If all the vertices are colored, stop. Otherwise, return to 3.
      *
      * @param[in] partition The set of iterators that should be colored.
      * @param[in] get_conflict_indices A user defined function object