← Back to branch summary

~tapaal-ltl/verifypn/scc-optimise

« back to all changes in this revision

Viewing changes to src/CTL/SearchStrategy/HeuristicSearch.cpp

  • Committer: srba.jiri at gmail
  • Date: 2020-09-11 14:23:39 UTC
  • mfrom: (213.1.151 interval_tar)
  • Revision ID: srba.jiri@gmail.com-20200911142339-bq9328s1gppw24uj
merged in lp:~verifypn-maintainers/verifypn/interval_tar doing 
- Implements TAR w/o z3, but using a simple integer inference engine for Hoare logic.
 - Replaces LP-Solve with GLPK, reduces computation-time and memory overhead
 - Implements new global properties, translated into CTL formulae.

Show diffs side-by-side

added added

removed removed

Lines of Context:
src/CTL/SearchStrategy/HeuristicSearch.cpp
 
1
/* 
 
2
 * File:   Encoder.h
 
3
 * Author: Peter G. Jensen
 
4
 * 
 
5
 * Created on March 7, 2018, 1:51 PM
 
6
 */
 
7
 
 
8
#include "CTL/SearchStrategy/HeuristicSearch.h"
 
9
#include "CTL/DependencyGraph/Edge.h"
 
10
#include "CTL/DependencyGraph/Configuration.h"
 
11
 
 
12
namespace SearchStrategy {
 
13
 
 
14
    size_t HeuristicSearch::Wsize() const {
 
15
        return W.size();
 
16
    }
 
17
 
 
18
    void HeuristicSearch::pushToW(DependencyGraph::Edge* edge) {
 
19
        W.push_back(edge);
 
20
    }
 
21
 
 
22
    DependencyGraph::Edge* HeuristicSearch::popFromW() {
 
23
        auto it = std::max_element(W.begin(), W.end(), [](auto a, auto b){
 
24
            return a->targets.size() < b->targets.size();
 
25
        });
 
26
        auto edge = *it;
 
27
        W.erase(it);
 
28
        return edge;
 
29
    }  
 
30
}