mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-05 17:14:07 +00:00
Code Activity

remove ast.h reference

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2017-10-25 09:49:53 -07:00
parent f5f1d019d8
commit 0268f2243e
2 changed files with 5 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
src/util/min_cut.cpp
View file

@ -16,6 +16,7 @@ Revision History:
--*/
#include "util/min_cut.h"
#include "util/trace.h"
min_cut::min_cut() {
// push back two empty vectors for source and sink
@ -74,7 +75,8 @@ void min_cut::compute_min_cut(unsigned_vector& cut_nodes) {
bool_vector reachable(m_edges.size());
compute_reachable_nodes(reachable);
// find all edges between reachable and unreachable nodes and for each such edge, add corresponding lemma to unsat-core
// find all edges between reachable and unreachable nodes and
// for each such edge, add corresponding lemma to unsat-core
compute_cut_and_add_lemmas(reachable, cut_nodes);
}
@ -91,7 +93,8 @@ void min_cut::compute_initial_distances() {
if (!visited[current]) {
bool exists_unvisited_parent = false;
// add unprocessed parents to stack for DFS. If there is at least one unprocessed parent, don't compute the result
// add unprocessed parents to stack for DFS. If there is at least
// one unprocessed parent, don't compute the result
// for current now, but wait until those unprocessed parents are processed
for (auto const& edge : m_edges[current]) {
unsigned parent = edge.node;

1
src/util/min_cut.h
View file

@ -19,7 +19,6 @@ Revision History:
#ifndef MIN_CUT_H_
#define MIN_CUT_H_
#include "ast/ast.h"
#include "util/vector.h"