diff --git a/src/testLemonTiger.cpp b/src/testLemonTiger.cpp
index 95e5350..e521019 100644
--- a/src/testLemonTiger.cpp
+++ b/src/testLemonTiger.cpp
@@ -1,21 +1,40 @@
+#include <map>
+#include <iomanip>
 
 #include "testLemonTiger.h"
 #include "toolkit.h"
 
+#define COLW 15
+#define OUTPRECISION 6
 
 using namespace std;
 
+typedef struct {
+  double head;
+  double demand;
+  double quality;
+} singleState_t;
+
+typedef map<int, singleState_t> networkState_t; // nodeIndex, state
+typedef map<long, networkState_t> result_t;     // time, networkState
+// access results by, for instance, resultsContainer[time][nodeIndex].head
+
+
+
 void checkErr(int err, std::string function);
-void hydStats();
-void qualStats();
+void saveHydResults(networkState_t* networkState);
+void saveQualResults(networkState_t* networkState);
+void printResults(result_t* state1, result_t* state2, std::ostream& out);
 
 int main(int argc, char * argv[]) {
   
+  // create storage structures for results.
+  result_t epanetResults, lemonTigerResults;
+  
   cout << "Lemon Tiger TEST" << endl
        << "________________" << endl;
   
   
-  long tstep = 0;
   long simulationTime = 0;
   long nextEventH = 0, nextEventQ = 0;
   long simTimeRemaining = 0;
@@ -32,15 +51,14 @@ int main(int argc, char * argv[]) {
     cout << "Running hydraulics..." << endl;
     do {
       
-      /* Solve for hydraulics & advance to next time period */
-      tstep = 0;
-      
+      /* Solve for hydraulics & advance to next time period */      
       checkErr( ENrunH(&simulationTime), "ENrunH" );
       checkErr( ENnextH(&nextEventH), "ENnextH" );
       
-      hydStats();
-      
       // gather hydraulic results
+      saveHydResults(&epanetResults[simulationTime]);
+      
+      
       
     } while (nextEventH > 0);
     // hydraulics are done
@@ -56,7 +74,8 @@ int main(int argc, char * argv[]) {
       checkErr( ENrunQ(&simulationTime), "ENrunQ" );
       checkErr( ENnextQ(&nextEventH), "ENstepQ" );
       
-      qualStats();
+      // gather quality results
+      saveQualResults(&epanetResults[simulationTime]);
       
     } while (nextEventH > 0);
     // water quality is done
@@ -83,22 +102,15 @@ int main(int argc, char * argv[]) {
     
     cout << "Running stepwise hydraulics and water quality..." << endl;
     do {
-      /* Solve for hydraulics & advance to next time period */
-      tstep = 0;
-      
+      /* Solve for hydraulics & advance to next time period */      
       checkErr( ENrunH(&simulationTime), "ENrunH" );
       checkErr( ENrunQ(&simulationTime), "ENrunQ" );
-      
-      //stats();
-      
+            
       checkErr( ENnextH(&nextEventH), "ENnextH" );
       checkErr( ENnextQ(&nextEventQ), "ENstepQ" );
       
-      //hydStats();
-      qualStats();
-      
-      // wq results
-      //cout << simulationTime << "\t\t" << nextEventH << endl;
+      saveHydResults(&lemonTigerResults[simulationTime]);
+      saveQualResults(&lemonTigerResults[simulationTime]);
       
     } while (nextEventH > 0);
     cout << "\t\t\tdone." << endl;
@@ -109,34 +121,100 @@ int main(int argc, char * argv[]) {
     checkErr( ENclose(), "ENclose" );
     
     
+    // summarize the results
+    printResults(&epanetResults, &lemonTigerResults, cout);
+    
+    
   } catch (int err) {
     cerr << "exiting with error " << err << endl;
   }
 }
 
 
-
-void hydStats() {
-  long htime;
-  int nodeIndex;
-  float head;
-  ENgettimeparam(EN_HTIME, &htime);
-  ENgetnodeindex((char*)"NewportTank", &nodeIndex);
-  ENgetnodevalue(nodeIndex, EN_HEAD, &head);
-  cout << htime << "\t\th = " << head << endl;
+void saveHydResults(networkState_t* networkState) {
+  int nNodes;
+  float head, demand;
+  ENgetcount(EN_NODECOUNT, &nNodes);
+  
+  for (int iNode = 1; iNode <= nNodes; iNode++) {
+    ENgetnodevalue(iNode, EN_HEAD, &head);
+    ENgetnodevalue(iNode, EN_DEMAND, &demand);
+    (*networkState)[iNode].head = head;
+    (*networkState)[iNode].demand = demand;
+  }
 }
 
-void qualStats() {
-  long htime;
-  int nodeIndex;
+
+void saveQualResults(networkState_t* networkState) {
+  int nNodes;
   float quality;
-  ENgettimeparam(EN_HTIME, &htime);
-  ENgetnodeindex((char*)"NewportTank", &nodeIndex);
-  ENgetnodevalue(nodeIndex, EN_QUALITY, &quality);
-  cout << htime << "\t\tc = " << quality << endl;
+  ENgetcount(EN_NODECOUNT, &nNodes);
+  
+  for (int iNode = 1; iNode <= nNodes; iNode++) {
+    ENgetnodevalue(iNode, EN_QUALITY, &quality);
+    (*networkState)[iNode].quality = quality;
+  }
 }
 
 
+void printResults(result_t* results1, result_t* results2, std::ostream &out) {
+  
+  result_t::const_iterator resultIterator;
+  
+  for (resultIterator = (*results1).begin(); resultIterator != (*results1).end(); ++resultIterator) {
+    // get the current frame
+    const long time = resultIterator->first;
+    const networkState_t state1 = resultIterator->second;
+    
+    // see if this time is indexed in the second state container
+    if ((*results2).find(time) == (*results2).end()) {
+      // nope.
+      out << "time " << time << " not found in second result set" << endl;
+    }
+    else {
+      // get the second result set's state
+      const networkState_t state2 = (*results2)[time];
+      
+      // print the current simulation time
+      out << left;
+      out << setfill('*') << setw(100) << "*" << endl;
+      out << setfill(' ');
+      out << setw(4) << "T = " << setw(6) << time;
+      out << "|" << setw(3*COLW) << "EPANET";
+      out << "|" << setw(3*COLW) << "LemonTiger" << endl;
+      out << setw(10) << "Index" << "|";
+      out << setw(COLW) << "Demand" << setw(COLW) << "Head" << setw(COLW) << "Quality" << "|";
+      out << setw(COLW) << "Demand" << setw(COLW) << "Head" << setw(COLW) << "Quality" << endl;
+      out << setprecision(OUTPRECISION);
+      
+      // loop through the nodes in the networkState objs, and print out the results for this time period
+      networkState_t::const_iterator networkIterator;
+      for (networkIterator = state1.begin(); networkIterator != state1.end(); ++networkIterator) {
+        int nodeIndex = networkIterator->first;
+        // trusting that all nodes are present...
+        const singleState_t nodeState1 = networkIterator->second;
+        const singleState_t nodeState2 = state2.at(nodeIndex);
+        
+        // epanet
+        out << setw(10) << nodeIndex << "|";
+        out << setw(COLW) << nodeState1.demand;
+        out << setw(COLW) << nodeState1.head;
+        out << setw(COLW) << nodeState1.quality;
+        
+        // lemontiger
+        out << "|";
+        out << setw(COLW) << nodeState2.demand;
+        out << setw(COLW) << nodeState2.head;
+        out << setw(COLW) << nodeState2.quality;
+        out << endl;
+        
+      }
+      
+    }
+  }
+  
+}
+
 
 void checkErr(int err, std::string function) {
   if (err > 0) {