boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-09 23:22:11 +00:00
Code Issues Projects Releases Wiki Activity

Fix criterion

Browse Source 
[SVN r36400]
This commit is contained in:
Douglas Gregor
2006-12-15 12:58:54 +00:00
parent b493c0ea47
commit dfb49e339d
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/sloan_ordering.htm
View File

@@ -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.