niklas/ki_rwu_java
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Created package uninformed for uninformed search algorithms and moved the implementations to this package

Browse Source
This commit is contained in:
Niklas Birk 2019-04-01 20:27:14 +02:00
parent bb95a412d8
commit 4a0b04aefe
6 changed files with 8 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/search/breadthfirstsearch/BreadthFirstSearch.java → src/search/uninformed/breadthfirstsearch/BreadthFirstSearch.java
View File

@ -1,4 +1,4 @@
package search.breadthfirstsearch; package search.uninformed.breadthfirstsearch;
import search.Node; import search.Node;

2
src/search/depthfirstsearch/DepthFirstSearch.java → src/search/uninformed/depthfirstsearch/DepthFirstSearch.java
View File

@ -1,4 +1,4 @@
package search.depthfirstsearch; package search.uninformed.depthfirstsearch;
import search.Node; import search.Node;

2
src/search/iterativedeepening/IterativeDeepening.java → src/search/uninformed/iterativedeepening/IterativeDeepening.java
View File

@ -1,4 +1,4 @@
package search.iterativedeepening; package search.uninformed.iterativedeepening;
import search.Node; import search.Node;

4
test/search/breadthfirstsearch/BreadthFirstSearchTest.java → test/search/uninformed/breadthfirstsearch/BreadthFirstSearchTest.java
View File

@ -1,4 +1,4 @@
package search.breadthfirstsearch; package search.uninformed.breadthfirstsearch;
import org.junit.jupiter.api.Test; import org.junit.jupiter.api.Test;
import search.EightPuzzleNode; import search.EightPuzzleNode;
@ -32,7 +32,7 @@ class BreadthFirstSearchTest
} }
@Test @Test
void shouldReturnCorrectTargetChubekNode() void shouldReturnCorrectTargetCubekNode()
{ {
int[][] state = { int[][] state = {
{2, 0, 4}, {2, 0, 4},

2
test/search/depthfirstsearch/DepthFirstSearchTest.java → test/search/uninformed/depthfirstsearch/DepthFirstSearchTest.java
View File

@ -1,4 +1,4 @@
package search.depthfirstsearch; package search.uninformed.depthfirstsearch;
import org.junit.jupiter.api.Test; import org.junit.jupiter.api.Test;
import search.EightPuzzleNode; import search.EightPuzzleNode;

8
test/search/iterativedeepening/IterativeDeepeningTest.java → test/search/uninformed/iterativedeepening/IterativeDeepeningTest.java
View File

@ -1,12 +1,8 @@
package search.iterativedeepening; package search.uninformed.iterativedeepening;
import org.junit.jupiter.api.Test; import org.junit.jupiter.api.Test;
import search.EightPuzzleNode; import search.EightPuzzleNode;
import search.breadthfirstsearch.BreadthFirstSearch;
import java.util.List;
import static org.junit.jupiter.api.Assertions.*;
import static search.SearchTestUtils.printSolution; import static search.SearchTestUtils.printSolution;
class IterativeDeepeningTest class IterativeDeepeningTest
@ -34,7 +30,7 @@ class IterativeDeepeningTest
} }
@Test @Test
void shouldReturnCorrectTargetChubekNode() void shouldReturnCorrectTargetCubekNode()
{ {
int[][] state = { int[][] state = {
{2, 0, 4}, {2, 0, 4},