From dfb49e339d8b439446598ceef5d0126c7fe12c42 Mon Sep 17 00:00:00 2001 From: Douglas Gregor Date: Fri, 15 Dec 2006 12:58:54 +0000 Subject: [PATCH] Fix criterion [SVN r36400] --- doc/sloan_ordering.htm | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/sloan_ordering.htm b/doc/sloan_ordering.htm index 52776aed..ec99d926 100755 --- a/doc/sloan_ordering.htm +++ b/doc/sloan_ordering.htm @@ -87,9 +87,9 @@ manually. But there is also an algorithm sloan_starting_nodes that provides usually quite good start and end vertices. Each vertex is asigned with a priority. This priority is a weighted sum of the distance of the vector to the end vertex - (a global criterium) and is called the current degree of vertex. This current + (a global criterion) and is called the current degree of vertex. This current degree basically reflects the status of the renumbering in the neighborhood - of a vertex (a local criterium). Therefore the Sloan algorithm (in contrast + of a vertex (a local criterion). Therefore the Sloan algorithm (in contrast to-McKee) takes into account local as well as global criteria for the renumbering sequence. One can play around with the relative weights, but the default values proposed by Sloan (weight1/weight2=1/2) turn out to be pretty good in most cases.