Add documentation on the newrank attribute.

diff --git a/doc/info/attrs.html b/doc/info/attrs.html
index 3767ade2ed0716d617b6cdf03e80e8a43b5fe98d..1c411eceea1e5fcbd8f57b9a1ad3e5a463fa0da9 100644 (file)
--- a/doc/info/attrs.html
+++ b/doc/info/attrs.html
@@ -326,6 +326,9 @@ of the layout programs.
  <TR><TD><A NAME=a:mosek HREF=#d:mosek>mosek</A>
 </TD><TD>G</TD><TD><A HREF=#k:bool>bool</A>
 </TD><TD ALIGN="CENTER">false</TD><TD></TD><TD>neato only</TD> </TR>
+ <TR><TD><A NAME=a:newrank HREF=#d:newrank>newrank</A>
+</TD><TD>G</TD><TD><A HREF=#k:bool>bool</A>
+</TD><TD ALIGN="CENTER">false</TD><TD></TD><TD>dot only</TD> </TR>
  <TR><TD><A NAME=a:nodesep HREF=#d:nodesep>nodesep</A>
 </TD><TD>G</TD><TD>double</TD><TD ALIGN="CENTER">0.25</TD><TD>0.02</TD><TD></TD> </TR>
  <TR><TD><A NAME=a:nojustify HREF=#d:nojustify>nojustify</A>
@@ -1326,6 +1329,17 @@ of the layout programs.
 <DD>  If Graphviz is built with MOSEK defined, mode=ipsep and mosek=true,
   the Mosek software (www.mosek.com) is use to solve the ipsep constraints.
 
+<DT><A NAME=d:newrank HREF=#a:newrank><STRONG>newrank</STRONG></A>
+<DD>  The original ranking algorithm in dot is recursive on clusters. This can produce fewer ranks
+  and a more compact layout, but sometimes at the cost of a head node being place on a higher
+  rank than the tail node. It also assumes that a node is not constrained in separate, 
+  incompatible subgraphs. For example, a node cannot be in a cluster and also be constrained by
+  <TT>rank=same</TT> with a node not in the cluster.
+  <P>
+  If <TT>newrank=true</TT>, the ranking algorithm does a single global ranking, ignoring clusters.
+  This allows nodes to be subject to multiple constraints. Rank constraints will usually take
+  precedence over edge constraints.
+
 <DT><A NAME=d:nodesep HREF=#a:nodesep><STRONG>nodesep</STRONG></A>
 <DD>  In dot, this specifies the minimum space between two adjacent nodes in the same rank, in inches.
   <P>

diff --git a/doc/infosrc/attrs b/doc/infosrc/attrs
index 9196884f335d3ab4300896ee4c351b621dc28ca2..225079bacb84ff24a5e23e6129f4b0cfd155ec13 100644 (file)
--- a/doc/infosrc/attrs
+++ b/doc/infosrc/attrs
@@ -771,6 +771,16 @@ graph, the input can specify all of the relevant distances.
 :mosek:G:bool:false;    neato
 If Graphviz is built with MOSEK defined, mode=ipsep and mosek=true,
 the Mosek software (www.mosek.com) is use to solve the ipsep constraints.
+:newrank:G:bool:false;    dot
+The original ranking algorithm in dot is recursive on clusters. This can produce fewer ranks
+and a more compact layout, but sometimes at the cost of a head node being place on a higher
+rank than the tail node. It also assumes that a node is not constrained in separate, 
+incompatible subgraphs. For example, a node cannot be in a cluster and also be constrained by
+<TT>rank=same</TT> with a node not in the cluster.
+<P>
+If <TT>newrank=true</TT>, the ranking algorithm does a single global ranking, ignoring clusters.
+This allows nodes to be subject to multiple constraints. Rank constraints will usually take
+precedence over edge constraints.
 :nodesep:G:double:0.25:0.02;
 In dot, this specifies the minimum space between two adjacent nodes in the same rank, in inches.
 <P>