[Xmlgraphics-fop Wiki] Trivial Update of "GoogleSummerOfCode2006/FloatsImplementationProgress" by VincentHennebert

[Apache Wiki <wi...@apache.org>]

Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Xmlgraphics-fop Wiki" for change notification.

The following page has been changed by VincentHennebert:
http://wiki.apache.org/xmlgraphics-fop/GoogleSummerOfCode2006/FloatsImplementationProgress

The comment on the change is:
More on the acyclic graph

------------------------------------------------------------------------------
  There are three main aspects which characterize the algorithm:
   * the building of a sequence of glue/box/penalty elements from some input data;
   * the definition of a somewhat arbitrary formula used to compute the demerit of each break, and which is to be minimized;
-  * the algorithm itself, which corresponds to the finding of a shortest path in an acyclic graph.
+  * the algorithm itself, which corresponds to the finding of a shortest path in an acyclic graph. The nodes are breakpoints and each edge is  tagged by the demerit of the corresponding line.
  
  To enter a bit in the details:
   * a line may be broken either at a penalty item, or at a glue immediately following a box;

---------------------------------------------------------------------
To unsubscribe, e-mail: fop-commits-unsubscribe@xmlgraphics.apache.org
For additional commands, e-mail: fop-commits-help@xmlgraphics.apache.org