<DT><A NAME=d:epsilon HREF=#a:epsilon><STRONG>epsilon</STRONG></A>
<DD> Terminating condition. If the length squared of all energy gradients are
- < <B>epsilon</B>, the algorithm stops.
+ < <B>epsilon</B>, the algorithm stops.
<DT><A NAME=d:esep HREF=#a:esep><STRONG>esep</STRONG></A>
<DD> Margin used around polygons for purposes of spline edge routing.
neato uses stress majorization. If <B>mode</B> is <TT>"KK"</TT>,
neato uses a version of the gradient descent method. The only advantage
to the latter technique is that it is sometimes appreciably faster for
- small (number of nodes < 100) graphs. A significant disadvantage is that
+ small (number of nodes < 100) graphs. A significant disadvantage is that
it may cycle. If <B>mode</B> is <TT>"sgd"</TT>, neato uses a version of the
stochastic gradient descent method. The advantage of sgd is faster and more
reliable convergence than both the previous methods, while the disadvantage
or <A HREF=#d:edgeURL>edgeURL</A> attribute.
:epsilon:G:double:.0001 * # nodes(mode == KK)/.0001(mode == major)/.01(mode == sgd); neato
Terminating condition. If the length squared of all energy gradients are
-< <B>epsilon</B>, the algorithm stops.
+< <B>epsilon</B>, the algorithm stops.
:esep:G:addDouble/addPoint:+3; notdot
Margin used around polygons for purposes of spline edge routing.
The interpretation is the same as given for <A HREF=#d:sep>sep</A>.
neato uses stress majorization. If <B>mode</B> is <TT>"KK"</TT>,
neato uses a version of the gradient descent method. The only advantage
to the latter technique is that it is sometimes appreciably faster for
-small (number of nodes < 100) graphs. A significant disadvantage is that
+small (number of nodes < 100) graphs. A significant disadvantage is that
it may cycle. If <B>mode</B> is <TT>"sgd"</TT>, neato uses a version of the
stochastic gradient descent method. The advantage of sgd is faster and more
reliable convergence than both the previous methods, while the disadvantage
Implement swim lanes (nodes sharing x coordinate), possibly based on sifting.
<li>
Complete support for aspect ratios in dot. We currently have a simple algorithm, but it doesn't work with many other features.
-Support aspect ratios < 1.
+Support aspect ratios < 1.
<li>
Allow maximum width contraints during layout.
<li>
<LI>
Unwrap the package:<BR>
You can use, for example,<BR><BR>
-<TT>gunzip < graphviz-working.tar.gz | tar xf -</TT><BR>
+<TT>gunzip < graphviz-working.tar.gz | tar xf -</TT><BR>
Let <TT>$ROOT</TT> be the directory in which you stored the Graphviz source.
<LI>
Configure the package for your system:<BR><BR>
<LI>
Unwrap the package:<BR>
If you have Unix tools available, you can use
-<TT>gunzip < graphviz-win.tgz | tar xf -</TT><BR>
+<TT>gunzip < graphviz-win.tgz | tar xf -</TT><BR>
If not, double click on the file and WinZip should start up and let you
store all of the files into a directory.<BR>
Let <TT>$ROOT</TT> be the directory in which you stored the Graphviz source.