aboutsummaryrefslogtreecommitdiffstats
path: root/sonar-graph
diff options
context:
space:
mode:
authorSimon Brandhof <simon.brandhof@gmail.com>2013-07-31 10:30:54 +0200
committerSimon Brandhof <simon.brandhof@gmail.com>2013-08-01 10:43:03 +0200
commitc2b40be7f722bfd9c96c0639f4650bca60c859f8 (patch)
treed34336b5a13fd1084769638a12fa6220065b0cd7 /sonar-graph
parent102fcaa285b796f70f1c422267360118dec3dd05 (diff)
downloadsonarqube-c2b40be7f722bfd9c96c0639f4650bca60c859f8.tar.gz
sonarqube-c2b40be7f722bfd9c96c0639f4650bca60c859f8.zip
Fix minor quality flaws
Diffstat (limited to 'sonar-graph')
-rw-r--r--sonar-graph/src/main/java/org/sonar/graph/MinimumFeedbackEdgeSetSolver.java9
1 files changed, 3 insertions, 6 deletions
diff --git a/sonar-graph/src/main/java/org/sonar/graph/MinimumFeedbackEdgeSetSolver.java b/sonar-graph/src/main/java/org/sonar/graph/MinimumFeedbackEdgeSetSolver.java
index 2d3feee9042..578879645ab 100644
--- a/sonar-graph/src/main/java/org/sonar/graph/MinimumFeedbackEdgeSetSolver.java
+++ b/sonar-graph/src/main/java/org/sonar/graph/MinimumFeedbackEdgeSetSolver.java
@@ -73,8 +73,7 @@ public class MinimumFeedbackEdgeSetSolver {
Set<FeedbackEdge> pendingFeedbackEdges = new HashSet<FeedbackEdge>();
if (cyclesNumber < maxNumberCyclesForSearchingMinimumFeedback) {
searchFeedbackEdges(0, 0, pendingFeedbackEdges);
- }
- else {
+ } else {
lightResearchForFeedbackEdges();
}
}
@@ -112,15 +111,13 @@ public class MinimumFeedbackEdgeSetSolver {
if (doesFeedbackEdgesContainAnEdgeOfTheCycle(pendingFeedbackEdges, feedbackCycle)) {
searchFeedbackEdges(level + 1, pendingWeight, pendingFeedbackEdges);
- }
- else {
+ } else {
boolean hasAnEdgeWithOccurrenceOfOneBeenUsed = false;
for (FeedbackEdge feedbackEdge : feedbackCycle) {
if (feedbackEdge.getOccurences() == 1) {
if (hasAnEdgeWithOccurrenceOfOneBeenUsed) {
continue;
- }
- else {
+ } else {
hasAnEdgeWithOccurrenceOfOneBeenUsed = true;
}
}