# HG changeset patch
# User mmarzolla
# Date 1333976197 0
# Node ID 1bae6fda1bf57f0f9fd2c4f1bc3c1b98b3cf706d
# Parent  3dae0b025ccbbbb917cece85f60cf0f8b504aa9d
fixed documentation

diff -r 3dae0b025ccb -r 1bae6fda1bf5 main/queueing/doc/queueingnetworks.txi
--- a/main/queueing/doc/queueingnetworks.txi	Mon Apr 09 12:55:37 2012 +0000
+++ b/main/queueing/doc/queueingnetworks.txi	Mon Apr 09 12:56:37 2012 +0000
@@ -1118,11 +1118,10 @@
 The @code{queueing} package provides a high-level function
 @code{qnsolve} for analyzing QN models. @code{qnsolve} takes as input
 a high-level description of the queueing model, and delegates the
-actual solution of the model to one of the lower-level function
-described in the previous section. @code{qnsolve} supports single or
-multiclass models, but at the moment only product-form networks can be
-analyzed. For non product-form networks @xref{Algorithms for non
-Product-Form QNs}.
+actual solution of the model to one of the lower-level
+function. @code{qnsolve} supports single or multiclass models, but at
+the moment only product-form networks can be analyzed. For non
+product-form networks @xref{Algorithms for non Product-Form QNs}.
 
 @code{qnsolve} accepts two input parameters. The first one is the list
 of nodes, encoded as an Octave @emph{cell array}. The second parameter
@@ -1174,7 +1173,6 @@
 @GETDEMO{qnsolve,1}
 @end example
 
-
 @c
 @c
 @c