blob: 5d772b5768d46c75a26b33e1ab79dab1502133db (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/********************* */
/*! \file trans_closure.cpp
** \verbatim
** Original author: barrett
** Major contributors: ajreynol
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief The transitive closure module implementation
**
** Implementation file for TransitiveClosure class.
**/
#include "util/trans_closure.h"
#include "util/Assert.h"
using namespace std;
namespace CVC4 {
TransitiveClosure::~TransitiveClosure() {
unsigned i;
for (i = 0; i < adjMatrix.size(); ++i) {
if (adjMatrix[i]) {
adjMatrix[i]->deleteSelf();
}
}
}
bool TransitiveClosure::addEdge(unsigned i, unsigned j)
{
// Check for loops
Assert(i != j, "Cannot add self-loop");
if (adjMatrix.size() > j && adjMatrix[j] != NULL && adjMatrix[j]->read(i)) {
return true;
}
// Grow matrix if necessary
unsigned maxSize = ((i > j) ? i : j) + 1;
while (maxSize > adjMatrix.size()) {
adjMatrix.push_back(NULL);
}
// Add edge from i to j and everything j can reach
if (adjMatrix[i] == NULL) {
adjMatrix[i] = new (true) CDBV(d_context);
}
adjMatrix[i]->write(j);
if (adjMatrix[j] != NULL) {
adjMatrix[i]->merge(adjMatrix[j]);
}
// Add edges from everything that can reach i to j and everything that j can reach
unsigned k;
for (k = 0; k < adjMatrix.size(); ++k) {
if (adjMatrix[k] != NULL && adjMatrix[k]->read(i)) {
adjMatrix[k]->write(j);
if (adjMatrix[j] != NULL) {
adjMatrix[k]->merge(adjMatrix[j]);
}
}
}
return false;
}
bool TransitiveClosure::isConnected(unsigned i, unsigned j)
{
if( i>=adjMatrix.size() || j>adjMatrix.size() ){
return false;
}else{
return adjMatrix[i] != NULL && adjMatrix[i]->read(j);
}
}
void TransitiveClosure::debugPrintMatrix()
{
unsigned i,j;
for (i = 0; i < adjMatrix.size(); ++i) {
for (j = 0; j < adjMatrix.size(); ++j) {
if (adjMatrix[i] != NULL && adjMatrix[i]->read(j)) {
Debug("trans-closure") << "1 ";
}
else Debug("trans-closure") << "0 ";
}
Debug("trans-closure") << endl;
}
}
unsigned TransitiveClosureNode::getId( Node i ){
context::CDMap< Node, unsigned, NodeHashFunction >::iterator it = nodeMap.find( i );
if( it==nodeMap.end() ){
unsigned c = d_counter.get();
nodeMap[i] = c;
d_counter.set( c + 1 );
return c;
}
return (*it).second;
}
void TransitiveClosureNode::debugPrint(){
for( int i=0; i<(int)currEdges.size(); i++ ){
Debug("trans-closure") << "currEdges[ " << i << " ] = "
<< currEdges[i].first << " -> " << currEdges[i].second;
Debug("trans-closure") << std::endl;
}
}
}/* CVC4 namespace */
|
