X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=README.md;h=1d6f5bd811b5706b39890c13fe4d5404dc7768c1;hb=07a8c54a66b01f342e4d03ca2cf99710d56806d0;hp=2ff5b9966b69eb4031506fd123b2fa2fc32bd961;hpb=9dad4fa1118632bfa02c01e4d6a8a5a129061a54;p=dagnn.git

diff --git a/README.md b/README.md
index 2ff5b99..1d6f5bd 100644
--- a/README.md
+++ b/README.md
@@ -1,7 +1,11 @@
 
-This package implements a new module nn.DAG which inherits from nn.Container and allows to combine modules in an arbitrary graph without cycle.
+#Introduction#
 
-#Example#
+This package implements a new module nn.DAG which inherits from
+nn.Container and allows to combine modules in an arbitrary graph
+without cycle.
+
+##Example##
 
 A typical use would be:
 
@@ -40,14 +44,70 @@ which would encode the following graph
 
 and run a forward pass with a random batch of 30 samples.
 
-Note that DAG:connect allows to add a bunch of edges at once. This is particularly useful to add anonymous modules which have a single predecessor and successor.
+Note that DAG:connect allows to add a bunch of edges at once. This is
+particularly useful to add anonymous modules which have a single
+predecessor and successor.
+
+#Usage#
+
+##Input and output##
+
+The DAG can deal with modules which take as input and produce as
+output tensors and nested tables of tensors.
+
+If a node has a single predecessor, the output of the latter is taken
+as-is as the input of the former. If it has multiple predecessors, all
+the outputs are collected into a table, and the table is used as
+input. The indexes of the outputs in that table reflects the order in
+which the edges where created in the DAG:connect() commands.
+
+The input to the DAG (respectively the produced output) is a nested
+table of inputs reflecting the structure of the nested table of
+modules provided to DAG:setInput (respectively DAG:setOutput)
+
+So for instance, in the example above, the model expects a tensor as
+input, since it is the input to the module a, and its output will is a
+table composed of two tensors, corresponding to the outputs of d and e
+respectively.
+
+##Functions##
+
+###nn.DAG()###
+
+Create a new empty DAG, which inherits from nn.Container.
 
-#Input and output#
+###nn.DAG:connect([module1 [, module2 [, ...]]])###
 
-If a node has a single successor, its output is sent unchanged as input to that successor. If it has multiple successors, the outputs are collected into a table, and the table is used as input to the successor node. The indexes of the outputs in that table reflects the order of the DAG:connect() commands.
+Add new nodes corresponding to the modules passed as arguments if they
+are not already existing. Add edges between every two nodes
+corresponding to a pair of successive modules in the arguments.
 
-The expected input (respectively the produced output) is a nested table of inputs reflecting the structure of the nested table of modules provided to DAG:setInput (respectively DAG:setOutput)
+Calling it with n > 2 arguments is strictly equivalent to calling it
+n-1 times on the pairs of successive arguments.
 
-So for instance, in the example above, the model expects a tensor as input, since it is the input to the module a, and its output will is a table composed of two tensors, corresponding to the outputs of d and e respectively.
+###nn.DAG:setInput(i)###
+
+Defines the content and structure of the input. The argument should be
+either a module, or a (nested) table of modules. The input to the DAG
+should be a (nested) table of inputs, with the corresponding structure.
+
+###nn.DAG:setOutput(o)###
+
+Similar to DAG:setInput().
+
+###nn.DAG:print()###
+
+Prints the list of nodes.
+
+###nn.DAG:saveDot(filename)###
+
+Save a dot file to be used by the Graphviz set of tools for graph
+visualization. This dot file can than be used for instance to produce
+a pdf file with
+
+```
+dot graph.dot -T pdf -o graph.pdf
+```
 
+-- 
 *Francois Fleuret, Jan 13th, 2017*