|
Go to the documentation of this file.
36 unsigned int getRoot();
37 unsigned int getNumberOfNodes();
39 void SetExamined( bool b);
42 void ReverseAndRoot();
49 root(gen.InitState()),
50 finalStates(gen.MarkedStates()),
51 numberOfNodes(gen.States().MaxIndex()),
52 nodeArray(gen.States().MaxIndex()),
53 examined(gen.States().MaxIndex()) {
64 if (eit->X1 != eit->X2) {
78 vector<unsigned int> mult (numberOfNodes);
82 for ( unsigned int i=0; i < nodeArray.size(); i++) {
85 if (mult[q-> state-1] != i+1) {
86 mult[q-> state-1] = i+1;
89 if (q-> blink != NULL) {
92 if (p-> link != NULL) {
120 cout << " ===== Displaying the graph ===== " << endl;
121 for ( unsigned int i=0; i < nodeArray.size(); i++) {
123 cout << "Neighbours of " << i+1 << ": ";
125 cout << q-> state << ", ";
133 for ( unsigned int i=0; i < nodeArray.size(); i++) {
146 while (!que.empty()) {
149 AccessibleSet. Insert(index);
159 return AccessibleSet;
173 for ( unsigned int i=0; i < v.size(); i++) {
176 for ( unsigned int i=0; i < nodeArray.size(); i++) {
180 sNode-> link = v[q->state-1];
181 v[q->state-1] = sNode;
187 StateSet::Iterator sit;
207 for ( unsigned int i=0; i < nodeArray.size(); i++) {
224 cerr << "=============================================================================\n"
225 << "You probably use numbers for state names, and some state-numbers are missing.\n"
226 << "Rename states for the algorithm to work more efficiently.\n"
227 << "=============================================================================" << endl;
231 cerr << "The generator is not deterministic." << endl;
236 cerr << "The generator does not have only one initial state." << endl;
libFAUDES 2.26g
--- 2015.08.17
--- c++ api documentaion by doxygen
|