Fix bug and add support for computing transitive closure of must edge graph

[satune.git] / src / Encoders / orderencoder.h

diff --git a/src/Encoders/orderencoder.h b/src/Encoders/orderencoder.h
index ae63cd682b7c9a4edd4d31059ff9fa272517254d..19252c32c3799d6d75bfdb1a1d7406e193be144d 100644 (file)
--- a/src/Encoders/orderencoder.h
+++ b/src/Encoders/orderencoder.h
@@ -24,9 +24,9 @@ void removeMustBeTrueNodes(OrderGraph *graph);
 void DFSPseudoNodeVisit(OrderGraph *graph, OrderNode *node);
 void completePartialOrderGraph(OrderGraph *graph);
 void DFSMust(OrderGraph *graph, VectorOrderNode *finishNodes);
-void DFSMustNodeVisit(OrderNode *node, VectorOrderNode *finishNodes, bool clearBackEdges);
-void DFSClearContradictions(OrderGraph *graph, VectorOrderNode *finishNodes);
-void reachMustAnalysis(OrderGraph *graph);
+void DFSMustNodeVisit(OrderNode *node, VectorOrderNode *finishNodes);
+void DFSClearContradictions(OrderGraph *graph, VectorOrderNode *finishNodes, bool computeTransitiveClosure);
+void reachMustAnalysis(OrderGraph *graph, bool computeTransitiveClosure);
 void localMustAnalysisTotal(OrderGraph *graph);
 void localMustAnalysisPartial(OrderGraph *graph);
 void orderAnalysis(CSolver *This);