about summary refs log tree commit diff
path: root/sourcecodes/parameter_learning/checkStructure.m
diff options
context:
space:
mode:
authorziejd22018-04-25 16:43:19 -0500
committerziejd22018-04-25 16:43:19 -0500
commit74b673ba4a706085201a5610b938ff98f08f641d (patch)
treecb39006ea1a39499e00dbbb0e0097087a4567031 /sourcecodes/parameter_learning/checkStructure.m
parenta781cb1ff2e7ae6de0f686bd02cd279261485b1e (diff)
downloadBNW-74b673ba4a706085201a5610b938ff98f08f641d.tar.gz
Bug fixes, code comments, and minor changes
Diffstat (limited to 'sourcecodes/parameter_learning/checkStructure.m')
-rw-r--r--sourcecodes/parameter_learning/checkStructure.m8
1 files changed, 6 insertions, 2 deletions
diff --git a/sourcecodes/parameter_learning/checkStructure.m b/sourcecodes/parameter_learning/checkStructure.m
index 5931c187..be3befda 100644
--- a/sourcecodes/parameter_learning/checkStructure.m
+++ b/sourcecodes/parameter_learning/checkStructure.m
@@ -1,7 +1,7 @@
 function [ labels, cases, dag, node_sizes, ord_flag ] = checkStructure(labels, cases, dag, node_sizes)
-    %checkStructure Check to see if nodes are sorted correctly.  They must be
+    %checkStructure Check to see if nodes are sorted correctly.  Nodes must be
     %   in topological order (i.e., parents before children) before parameter
-    %   learning can take place.
+    %   learning can take place. This function performs this sorting.
     %
     %Input and output have the same meaning.  The output has just been
     %topologically ordered.
@@ -9,6 +9,10 @@ function [ labels, cases, dag, node_sizes, ord_flag ] = checkStructure(labels, c
     %   cases = cell array with the data.
     %   dag = matrix with the strucutre of the network.
     %   node_sizes = vector with the size of each node.
+%
+%   checkStructure is called by readInput.m    
+
+
 
 %make connections array
 %count how big you need the connections array to be