nathanwoodburn/comp1110-ass2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 1 Wiki Activity

Fixed some documentation for Score Link

Browse Source 
Signed-off-by: Immanuel Alvaro Bhirawa <u7280427@anu.edu.au>
This commit is contained in:
Immanuel Alvaro Bhirawa 2023-05-10 19:19:40 +10:00
parent 7fcf6d3a1b
commit bad42dd8e8
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
src/comp1110/ass2/State.java
View File

@ -565,17 +565,17 @@ public class State {
* @return the highest score from a player's linked pieces * @return the highest score from a player's linked pieces
*/ */
public static int findLongestLinkScore ( Set<Coord> allCoords, Island[] islands) { public static int findLongestLinkScore ( Set<Coord> allCoords, Island[] islands) {
Set<Coord> longestPath = new HashSet<>(); Set<Coord> longestPath = new HashSet<>(); // Container for Longest Path
Set<Coord> currentPath = new HashSet<>(); Set<Coord> currentPath = new HashSet<>(); // Container for Current Path
Coord startingPoint; Coord startingPoint; // Starting point of the DFS Algo
int maxScore = findScoreForLink(longestPath,islands); int maxScore = findScoreForLink(longestPath,islands);
for(Island i : islands) { for(Island i : islands) {
for ( Coord c : allCoords) { for ( Coord c : allCoords) {
if(i.containsCoord(c)) { if(i.containsCoord(c)) {
startingPoint = c; // set starting Point startingPoint = c; // set starting Point with the current Coords in the Player's all pieces coords
// DFS Algo starts // DFS Algo starts
currentPath.add(startingPoint); currentPath.add(startingPoint);
@ -598,8 +598,8 @@ public class State {
} }
/** /**
* a DFS (Depth-First-Search) Recursion algorithm that traverses all the coordinates of a player's pieces with * a DFS (Depth-First-Search) Recursion algorithm that traverses all the coordinates of a player's pieces, with
* each step of the DFS algorithm determined by if the current coordinate is adjacent with other coordinates * each step of the DFS algorithm determined if the current coordinate is adjacent with other coordinates
* within the allCoords set and wether or not the currentPath is contained inside the allCoords. * within the allCoords set and wether or not the currentPath is contained inside the allCoords.
* @param allCoords all coordinates of a Player's pieces * @param allCoords all coordinates of a Player's pieces
* @param currentPath a set to store the path that the algorithm has gone through * @param currentPath a set to store the path that the algorithm has gone through
@ -613,14 +613,14 @@ public class State {
for(Coord c : allCoords) { for(Coord c : allCoords) {
// if (currentPath.size() > longestPath.size() ) longestPath = currentPath;
// if the startingPoint of the step is adjacent with the coords from allCoords and currentPath // if the startingPoint of the step is adjacent with the coords from allCoords and currentPath
// i.e. the `history tracker` of the path so far does not have `c` coords from allCoords // i.e. the `history tracker` of the path so far does not have `c` coords from allCoords
if( startingPoint.isAdjacentDiagonal(c) && !currentPath.contains(c) ) { if( startingPoint.isAdjacentDiagonal(c) && !currentPath.contains(c) ) {
// if the currentPath is bigger than the longestPath, update the longest Path // if the currentPath is bigger than the longestPath, update the longest Path
if (currentPath.size() > longestPath.size() ) longestPath = currentPath; if (currentPath.size() > longestPath.size() ) longestPath = currentPath;
DFSRecursionLink(allCoords, currentPath, longestPath, c);
DFSRecursionLink(allCoords, currentPath, longestPath, c); // Repeat the step for all coords
} }
} }
} }