Skip to content

style: include SUI_CONTAINS_BEFORE_ADD #5216

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
vil02 merged 1 commit into from
Jun 13, 2024
Merged

style: include SUI_CONTAINS_BEFORE_ADD #5216

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
style: include SUI_CONTAINS_BEFORE_ADD
  • Loading branch information
@vil02
vil02 committed Jun 13, 2024
commit 45c2308605c90579e050b41cd367a3aa57503a19
3 changes: 0 additions & 3 deletions spotbugs-exclude.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -222,9 +222,6 @@
<Match>
<Bug pattern="IMC_IMMATURE_CLASS_BAD_SERIALVERSIONUID" />
</Match>
<Match>
<Bug pattern="SUI_CONTAINS_BEFORE_ADD" />
</Match>
<Match>
<Bug pattern="DRE_DECLARED_RUNTIME_EXCEPTION" />
</Match>
Expand Down
3 changes: 1 addition & 2 deletions src/main/java/com/thealgorithms/datastructures/graphs/ConnectedComponent.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -81,8 +81,7 @@ public int countGraphs() {
Set<Node> markedNodes = new HashSet<Node>();

for (Node n : nodeList) {
if (!markedNodes.contains(n)) {
markedNodes.add(n);
if (markedNodes.add(n)) {
markedNodes.addAll(depthFirstSearch(n, new ArrayList<Node>()));
count++;
}
Expand Down