Added a check that all nodes are connected to the inputs.

diff --git a/dagnn.lua b/dagnn.lua
index 5921c05..67e113d 100755 (executable)
--- a/dagnn.lua
+++ b/dagnn.lua
@@ -76,6 +76,10 @@ function DAG:putInOrder()
       end
    until nc == 0
 
+   for _, nnm in pairs(self.modules) do
+      assert(distance[nnm], 'Some modules are not connected to inputs')
+   end
+
    self.sorted = {}
    for m, d in pairs(distance) do
       table.insert(self.sorted, { distance = d, nnm = m })
@@ -143,7 +147,7 @@ function DAG:setInput(i)
    self:nestedApply(
       function(nnm)
          if #self.node[nnm].succ == 0 then
-            error('Input modules must have outgoing  edges.')
+            error('Input modules must have outgoing edges.')
          end
          if #self.node[nnm].pred > 0 then
             error('Input modules cannot have incoming edges.')