10/10/17:

1. removed template from the circuit finder
2. combined the program, logic is up
3. testing remains 
4. have to write the shuffle function

include/circuitfinder.h

@@ -25,7 +25,7 @@ typedef list<int> NodeList;
 //void pairWiseTightestRelation (relation **graph, int V); //for tightening the matrix
 typedef struct{bool A; bool B;} bool2;
 void pairWiseTightestRelation (relation **graph, int V); //for tightening the matrix
-template<int N>
+
 class CircuitFinder // defining a circuit finder class
 {
   vector<NodeList> AK; //this is the matrix representaion using node list
@@ -33,24 +33,15 @@ class CircuitFinder // defining a circuit finder class
   vector<bool> Blocked; // a boolean array to indicate which nodes are blocked and which are not
   vector<NodeList> B; // special node.
   int S;
-
+    int N;
   void unblock(int U); //function to unblock the vertix U
   bool2 circuit(int V); // function to check if there is a circuit from note V
   bool cycleCheck(); //function to output the list of circuits in the graph
   relation **relmatrix;
 public:
-  CircuitFinder(int Array[N][N]) //convert associate matrix representation to list representation of grph
-    : AK(N), Blocked(N), B(N) {
-    for (int I = 0; I < N; ++I) {
-      for (int J = 0; J < N; ++J) {
-        if (Array[I][J]) {
-          AK[I].push_back(Array[I][J]);
-        }
-      }
-    }
-  }
-  CircuitFinder(relation **matrix) :AK(N), Blocked(N), B(N)
+  CircuitFinder(relation **matrix,int N) :AK(N), Blocked(N), B(N)
     {
+        this->N = N;
       relmatrix = new relation*[N];
       for(int i = 0; i < N; i++)
           relmatrix[i] = new relation[N];
@@ -76,106 +67,7 @@ public:
   bool run(); //start the run
 };
 
-template<int N>
-void CircuitFinder<N>::unblock(int U)
-{
-  Blocked[U - 1] = false;
-
-  while (!B[U - 1].empty()) {
-    int W = B[U - 1].front();
-    B[U - 1].pop_front();
-
-    if (Blocked[W - 1]) {
-      unblock(W);
-    }
-  }
-}
-
-template<int N>
-bool2 CircuitFinder<N>::circuit(int V)
-{
-  bool2 F;
-  F.A= false;
-  F.B = false;
-  Stack.push_back(V);
-  Blocked[V - 1] = true;
-  //bool check;
-  for (int W : AK[V - 1]) {
-    if (W == S) {
-      F.B = cycleCheck();
-      F.A = true;
-    } else if (W > S && !Blocked[W - 1]) {
-      F = circuit(W);
-    }
-  }
-
-  if (F.A) {
-    unblock(V);
-  } else {
-    for (int W : AK[V - 1]) {
-      auto IT = std::find(B[W - 1].begin(), B[W - 1].end(), V);
-      if (IT == B[W - 1].end()) {
-        B[W - 1].push_back(V);
-      }
-    }
-  }
-
-  Stack.pop_back();
-  return F;
-}
-
-template<int N>
-bool CircuitFinder<N>::cycleCheck() //here we need to check if there exists any cycle
-{ // with <+<=* regex. return 1 if there is a cycle and return 0 if not.
-  //cout << "circuit: "<<endl;
-  int countles=0;
-  for (auto I = Stack.begin(), E = Stack.end(); I != E; ++I) {
-      //checking of if the cycle have a < along with  other <=
-    // cout << *I << " -> ";
-    if(I+1 != E)
-      {
-	if(relmatrix[*I][*(I+1)] != leq || relmatrix[*I][*(I+1)] != les)
-	  {
-	    return false;
-	  }
-	else if(relmatrix[*I][*(I+1)] == les)
-	  countles++;
-      }
-    else
-      {
-	if(relmatrix[*I][*Stack.begin()] != leq || relmatrix[*I][*Stack.begin()] != les)
-	  return false;
-	else if (relmatrix[*I][*Stack.begin()] == les)
-	  countles ++;
-	
-      }
-    if( countles == 1)
-      return true;
-    else
-      return false;
-    
-  }
-  // cout << *Stack.begin() << std::endl;
-}
 
-template<int N>
-bool CircuitFinder<N>::run()
-{
-  Stack.clear();
-  S = 1;
-  bool2 returnval;
-  while (S < N) {
-    for (int I = S; I <= N; ++I) {
-      Blocked[I - 1] = false;
-      B[I - 1].clear();
-    }
-   returnval= circuit(S);
-   if(returnval.B == true)
-     return true;
-    ++S;
-  }
-  return false;
-}
 
 
 #endif /* CIRCUITFINDER_H */

include/tpdaCGPP.h

@@ -43,10 +43,10 @@ class stateGCPP{
 	stateGCPP* reduce(char dn);
 	
 	// return true iff clock gurards on new transition 'dn' with tsm value 'wn' is satisfied
-	bool consSatisfied(char dn, char wn, relation r, short *clockDis, bool *clockAcc);
+	bool consSatisfied(stateGCPP* vs, short* transitionMap,char dn, char wn, short *clockDis, bool *clockAcc);
 	
 	// check for stack constraint where 'dlr' and 'aclr' are distance and accuracy resp. from L to R
-	bool stackCheck(char dn, char wn,relation r, short dlr, bool aclr);
+	bool stackCheck(stateGCPP* vs,short* transitionMap,char dn, char wn, short dlr, bool aclr);
         //check if the relation between the fractional parts are good or not.
 	bool relationSatisfied(char dn,char wn,relation r,short *clockDis,bool *clockAcc);
 	// reduce the #points after shuffle operation by using forget operation if possible

makefile

@@ -7,12 +7,13 @@ EXE := tree
 GDB := -g
 
 
-tree : main.o $(OBJ)/treeBitOperations.o $(OBJ)/timePushDown.o $(OBJ)/continuoustpda.o $(OBJ)/pds.o $(OBJ)/tpdaCGPP.o $(OBJ)/tpdaZone.o $(OBJ)/tpda2.o drawsystem
-	g++ $(GDB) main.o $(OBJ)/treeBitOperations.o $(OBJ)/timePushDown.o $(OBJ)/continuoustpda.o $(OBJ)/pds.o $(OBJ)/tpdaCGPP.o $(OBJ)/tpdaZone.o $(OBJ)/tpda2.o -o $(EXE) $(CFLAG)
+tree : main.o $(OBJ)/treeBitOperations.o $(OBJ)/timePushDown.o $(OBJ)/continuoustpda.o $(OBJ)/pds.o $(OBJ)/tpdaCGPP.o $(OBJ)/tpdaZone.o $(OBJ)/tpda2.o $(OBJ)/circuitfinder.o drawsystem
+	g++ $(GDB) main.o $(OBJ)/treeBitOperations.o $(OBJ)/timePushDown.o $(OBJ)/continuoustpda.o $(OBJ)/pds.o $(OBJ)/tpdaCGPP.o $(OBJ)/tpdaZone.o $(OBJ)/tpda2.o $(OBJ)/circuitfinder.o -o $(EXE) $(CFLAG)
 
 main.o : main.cpp
 	g++ $(GDB) -I $(INC) -c main.cpp -o main.o $(CFLAG)
-	
+$(OBJ)/circuitfinder.o : $(SRC)/circuitfinder.cpp
+	g++ $(GDB) -I $(INC) -c $(SRC)/circuitfinder.cpp -o $(OBJ)/circuitfinder.o $(CFLAG)
 $(OBJ)/tpdaZone.o : $(SRC)/tpdaZone.cpp
 	g++ $(GDB) -I $(INC) -c $(SRC)/tpdaZone.cpp -o $(OBJ)/tpdaZone.o $(CFLAG)
 	

nbproject/configurations.xml

@@ -6,7 +6,7 @@
         <in>circuitfinder.h</in>
       </df>
       <df name="src">
-        <in>allpairshortest.cpp</in>
+        <in>circuitfinder.cpp</in>
         <in>continuoustpda.cpp</in>
         <in>drawsystem.cpp</in>
         <in>pds.cpp</in>
@@ -73,7 +73,7 @@
         <ccTool flags="0">
         </ccTool>
       </item>
-      <item path="src/allpairshortest.cpp" ex="false" tool="1" flavor2="0">
+      <item path="src/circuitfinder.cpp" ex="false" tool="1" flavor2="0">
       </item>
       <item path="src/continuoustpda.cpp" ex="false" tool="1" flavor2="8">
         <ccTool flags="0">

nbproject/private/configurations.xml

@@ -24,7 +24,7 @@
       <df name="output">
       </df>
       <df name="src">
-        <in>allpairshortest.cpp</in>
+        <in>circuitfinder.cpp</in>
         <in>continuoustpda.cpp</in>
         <in>drawsystem.cpp</in>
         <in>pds.cpp</in>

src/allpairshortest.cpp

-/*
- * To change this license header, choose License Headers in Project Properties.
- * To change this template file, choose Tools | Templates
- * and open the template in the editor.
- */
-
-// C Program for Floyd Warshall Algorithm
-#include<iostream>
-using namespace std;
-typedef enum {z,les,leq,que,na} relation;
-// Number of vertices in the graph
-//#define V 4
-relation addition[4][4] = {{les,les,que,les},{les,leq,que,leq},{que,que,que,que},{les,leq,que,na}};
-string sarr[4] = {"<","<=","?","NA"};
-/* Define Infinite as a large enough value. This value will be used
-for vertices not connected to each other */
-//#define INF na
-
-// A function to print the solution matrix
-void printSolution(relation dist[][], int V);
-
-// Solves the all-pairs shortest path problem using Floyd Warshall algorithm
-void floydWarshall (relation graph[][], int V)
-{
-	/* dist[][] will be the output matrix that will finally have the shortest 
-	distances between every pair of vertices */
-	relation dist[V][V];
-	int i, j, k;
-
-	/* Initialize the solution matrix same as input graph matrix. Or 
-	we can say the initial values of shortest distances are based
-	on shortest paths considering no intermediate vertex. */
-	for (i = 0; i < V; i++)
-		for (j = 0; j < V; j++)
-			dist[i][j] = graph[i][j];
-
-	/* Add all vertices one by one to the set of intermediate vertices.
-	---> Before start of a iteration, we have shortest distances between all
-	pairs of vertices such that the shortest distances consider only the
-	vertices in set {0, 1, 2, .. k-1} as intermediate vertices.
-	----> After the end of a iteration, vertex no. k is added to the set of
-	intermediate vertices and the set becomes {0, 1, 2, .. k} */
-	for (k = 0; k < V; k++)
-	{
-		// Pick all vertices as source one by one
-		for (i = 0; i < V; i++)
-		{
-			// Pick all vertices as destination for the
-			// above picked source
-			for (j = 0; j < V; j++)
-			{
-				// If vertex k is on the shortest path from
-				// i to j, then update the value of dist[i][j]
-				relation m = addition[dist[i][k]][dist[k][j]];
-				if (m < dist[i][j])
-					dist[i][j] = m;
-			}
-		}
-	}
-
-	// Print the shortest distance matrix
-	printSolution(dist);
-}
-
-/* A utility function to print solution */
-void printSolution(relation dist[][],int V)
-{
-	cout << "Following matrix shows the shortest distances" << 
-			" between every pair of vertices" << endl;
-	cout.width(7);
-	for (int i = 0; i < V; i++)
-	{
-		for (int j = 0; j < V; j++)
-		{
-			cout << sarr[dist[i][j]];
-		}
-		cout << endl;
-	}
-}
-
-// driver program to test above function
-int main()
-{
-	/* Let us create the following weighted graph
-			10
-	(0)------->(3)
-		|		 /|\
-	5 |		 |
-		|		 | 1
-	\|/		 |
-	(1)------->(2)
-			3		 */
-	relation graph[V][V] = { {z,que,les,na},
-						{na,z,na,leq},
-						{na,les,z,na},
-						{leq,na,na,z}
-					};
-
-	// Print the solution
-	floydWarshall(graph);
-	return 0;
-}

src/circuitfinder.cpp

+/*
+ * To change this license header, choose License Headers in Project Properties.
+ * To change this template file, choose Tools | Templates
+ * and open the template in the editor.
+ */
+#include "circuitfinder.h"
+void CircuitFinder::unblock(int U)
+{
+  Blocked[U - 1] = false;
+
+  while (!B[U - 1].empty()) {
+    int W = B[U - 1].front();
+    B[U - 1].pop_front();
+
+    if (Blocked[W - 1]) {
+      unblock(W);
+    }
+  }
+}
+
+
+bool2 CircuitFinder::circuit(int V)
+{
+  bool2 F;
+  F.A= false;
+  F.B = false;
+  Stack.push_back(V);
+  Blocked[V - 1] = true;
+  //bool check;
+  for (int W : AK[V - 1]) {
+    if (W == S) {
+      F.B = cycleCheck();
+      F.A = true;
+      if(F.B)
+          return F;
+    } else if (W > S && !Blocked[W - 1]) {
+      F = circuit(W);
+    }
+  }
+
+  if (F.A) {
+    unblock(V);
+  } else {
+    for (int W : AK[V - 1]) {
+      auto IT = std::find(B[W - 1].begin(), B[W - 1].end(), V);
+      if (IT == B[W - 1].end()) {
+        B[W - 1].push_back(V);
+      }
+    }
+  }
+
+  Stack.pop_back();
+  return F;
+}
+
+
+bool CircuitFinder::cycleCheck() //here we need to check if there exists any cycle
+{ // with <+<=* regex. return 1 if there is a cycle and return 0 if not.
+  cout << "circuit: ";
+  int countles=0;
+  for (auto I = Stack.begin(), E = Stack.end(); I != E; ++I) {
+      //checking of if the cycle have a < along with  other <=
+     cout << *I << " -> ";
+    if(I+1 != E)
+      {
+          
+	if(relmatrix[(*I)-1][(*(I+1))-1] != leq && relmatrix[(*I)-1][(*(I+1))-1] != les)
+	  {
+          
+	    return false;
+	  }
+	else if(relmatrix[(*I)-1][(*(I+1))-1] == les)
+	  countles++;
+      }
+    else
+      {
+	if(relmatrix[(*I)-1][(*Stack.begin())-1] != leq && relmatrix[(*I)-1][(*Stack.begin())-1] != les)
+    {
+        
+	  return false;
+    }
+	else if (relmatrix[(*I)-1][(*Stack.begin())-1] == les)
+	  countles ++;
+        
+	
+      }
+    if( countles == 1)
+      return true;
+    else
+      return false;
+    
+  }
+   cout << *Stack.begin() << std::endl;
+}
+
+
+bool CircuitFinder::run()
+{
+  Stack.clear();
+  S = 1;
+  bool2 returnval;
+  while (S < N) {
+    for (int I = S; I <= N; ++I) {
+      Blocked[I - 1] = false;
+      B[I - 1].clear();
+    }
+   returnval= circuit(S);
+   if(returnval.B == true)
+     return true;
+    ++S;
+  }
+  return false;
+}

src/timePushDown.cpp

@@ -142,10 +142,10 @@ void inputSystem() {
     {
         clock_reset[i] = 0; // the first reset points of every clocks is 0th transition.
     }
-    recent_matrix = new char*[T+1];
+    recent_matrix = new char*[T+1]; //allocate rows to the matrix which is the total number of transitions.
     for(int i = 0; i < T+1 ; i++)
     {
-        recent_matrix[i] = new char[X];
+        recent_matrix[i] = new char[X]; //for every row we have columns with the number of clocks 
      
     }
     for(int i = 0; i <X; i++)
@@ -262,7 +262,7 @@ void inputSystem() {
                 exit(1);
             }
             reset |= a32[x]; // set x-th bit of 'reset' to '1'
-            clock_reset[x] = i;
+            clock_reset[x] = i; // the latest transition which resets the clocks x is i.
         }
         
         // read stack operation number, 0 : nop, 1 : push, 2 : pop, 3 : pop & push