5 * Created on August 8, 2017, 6:36 PM
8 #ifndef ORDERGRAPHBUILDER_H
9 #define ORDERGRAPHBUILDER_H
10 #include "classlist.h"
14 void computeStronglyConnectedComponentGraph(OrderGraph *graph);
15 void orderAnalysis(CSolver *solver);
16 void initializeNodeInfoSCC(OrderGraph *graph);
17 void DFSNodeVisit(OrderNode *node, Vector<OrderNode *> *finishNodes, bool isReverse, bool mustvisit, uint sccNum);
18 void DFS(OrderGraph *graph, Vector<OrderNode *> *finishNodes);
19 void DFSReverse(OrderGraph *graph, Vector<OrderNode *> *finishNodes);
20 void completePartialOrderGraph(OrderGraph *graph);
21 void resetNodeInfoStatusSCC(OrderGraph *graph);
22 bool isMustBeTrueNode(OrderNode* node);
23 void bypassMustBeTrueNode(CSolver *This, OrderGraph* graph, OrderNode* node);
24 void removeMustBeTrueNodes(CSolver *This, OrderGraph *graph);
25 void completePartialOrderGraph(OrderGraph *graph);
26 void DFSMust(OrderGraph *graph, Vector<OrderNode *> *finishNodes);
27 void DFSClearContradictions(CSolver *solver, OrderGraph *graph, Vector<OrderNode *> *finishNodes, bool computeTransitiveClosure);
28 void reachMustAnalysis(CSolver *solver, OrderGraph *graph, bool computeTransitiveClosure);
29 void localMustAnalysisTotal(CSolver *solver, OrderGraph *graph);
30 void localMustAnalysisPartial(CSolver *solver, OrderGraph *graph);
32 #endif/* ORDERGRAPHBUILDER_H */