diogo/yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Use enum class instead of old enum.

Browse Source 
As we are relying on c++11x for other stuff too.
This commit is contained in:
Tiago Gomes
2013-03-09 15:39:39 +00:00
parent 7193d2238d
commit 532654baba
6 changed files with 19 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
packages/CLPBN/horus/ElimGraph.cpp
View File

@@ -183,7 +183,7 @@ ElimGraph::getLowestCostNode() const
unsigned minCost = Util::maxUnsigned();
EGNeighs::const_iterator it;
switch (elimHeuristic_) {
case minNeighborsEh: {
case ElimHeuristic::minNeighborsEh: {
for (it = unmarked_.begin(); it != unmarked_.end(); ++ it) {
unsigned cost = getNeighborsCost (*it);
if (cost < minCost) {
@@ -192,7 +192,7 @@ ElimGraph::getLowestCostNode() const
}
}}
break;
case minWeightEh: {
case ElimHeuristic::minWeightEh: {
for (it = unmarked_.begin(); it != unmarked_.end(); ++ it) {
unsigned cost = getWeightCost (*it);
if (cost < minCost) {
@@ -201,7 +201,7 @@ ElimGraph::getLowestCostNode() const
}
}}
break;
case minFillEh: {
case ElimHeuristic::minFillEh: {
for (it = unmarked_.begin(); it != unmarked_.end(); ++ it) {
unsigned cost = getFillCost (*it);
if (cost < minCost) {
@@ -210,7 +210,7 @@ ElimGraph::getLowestCostNode() const
}
}}
break;
case weightedMinFillEh: {
case ElimHeuristic::weightedMinFillEh: {
for (it = unmarked_.begin(); it != unmarked_.end(); ++ it) {
unsigned cost = getWeightedFillCost (*it);
if (cost < minCost) {