Small edit
authorHamed <hamed.gorjiara@gmail.com>
Fri, 1 Sep 2017 01:37:17 +0000 (18:37 -0700)
committerHamed <hamed.gorjiara@gmail.com>
Fri, 1 Sep 2017 01:37:17 +0000 (18:37 -0700)
src/ASTAnalyses/orderanalysis.h

index 9a8daf95d24201b08bbc880f2ed939b365a903ad..b04ccfddc465ef6abef06c7a0e3c8e79e0a46092 100644 (file)
@@ -14,7 +14,6 @@ void resetNodeInfoStatusSCC(OrderGraph *graph);
 bool isMustBeTrueNode(OrderNode *node);
 void bypassMustBeTrueNode(CSolver *This, OrderGraph *graph, OrderNode *node);
 void removeMustBeTrueNodes(CSolver *This, OrderGraph *graph);
 bool isMustBeTrueNode(OrderNode *node);
 void bypassMustBeTrueNode(CSolver *This, OrderGraph *graph, OrderNode *node);
 void removeMustBeTrueNodes(CSolver *This, OrderGraph *graph);
-void completePartialOrderGraph(OrderGraph *graph);
 void DFSMust(OrderGraph *graph, Vector<OrderNode *> *finishNodes);
 void DFSClearContradictions(CSolver *solver, OrderGraph *graph, Vector<OrderNode *> *finishNodes, bool computeTransitiveClosure);
 void reachMustAnalysis(CSolver *solver, OrderGraph *graph, bool computeTransitiveClosure);
 void DFSMust(OrderGraph *graph, Vector<OrderNode *> *finishNodes);
 void DFSClearContradictions(CSolver *solver, OrderGraph *graph, Vector<OrderNode *> *finishNodes, bool computeTransitiveClosure);
 void reachMustAnalysis(CSolver *solver, OrderGraph *graph, bool computeTransitiveClosure);