Index (algorithms 1.0.1 API)

A B C D E F G H I K L M N O P Q R S T U V W X Y
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

A

2. Array-Based Approach (Memoization) - Section in topics.divideconquer.fibonacci.Fibonacci.fibonacciArray(int)
AgentsTasks - Class in topics.backtracking.agents: Agent-Task Assignment
AgentsTasks - Class in topics.branchandbound.agents: Task Assignment
AgentsTasks - Class in topics.greedy.agents: Agent-Task Assignment
AgentsTasks(int[][]) - Constructor for class topics.backtracking.agents.AgentsTasks: Constructs the assignment engine performing a defensive copy of the cost matrix.
AgentsTasks(int[][]) - Constructor for class topics.greedy.agents.AgentsTasks: Constructs the assignment engine performing a defensive copy of the cost matrix.
AgentsTasks(int, int[][]) - Constructor for class topics.branchandbound.agents.AgentsTasks: Initializes the execution tree with the root node.
AgentsTasksDifferentSizesTimes - Class in topics.greedy.agents: Empirical Runtime Analysis for Agent Task Assignment
AgentsTasksDifferentSizesTimes() - Constructor for class topics.greedy.agents.AgentsTasksDifferentSizesTimes
AgentsTasksRandomValues - Class in topics.greedy.agents: Random Asset Generator for Agent Task Assignment
AgentsTasksRandomValues() - Constructor for class topics.greedy.agents.AgentsTasksRandomValues
AgentsTasksTest - Class in topics.backtracking.agents: Validation Suite for Backtracking Agent Assignment
AgentsTasksTest - Class in topics.branchandbound.agents: Test Suite for Task Assignment Algorithm
AgentsTasksTest - Class in topics.greedy.agents: Validation Suite for Agent-Task Assignment Problems
AgentsTasksTest() - Constructor for class topics.backtracking.agents.AgentsTasksTest
AgentsTasksTest() - Constructor for class topics.branchandbound.agents.AgentsTasksTest
AgentsTasksTest() - Constructor for class topics.greedy.agents.AgentsTasksTest
AgentsTasksTimes - Class in topics.backtracking.agents: Empirical Runtime Analysis for Backtracking
AgentsTasksTimes() - Constructor for class topics.backtracking.agents.AgentsTasksTimes
Agent-Task Assignment - Section in class topics.backtracking.agents.AgentsTasks
Agent-Task Assignment - Section in class topics.greedy.agents.AgentsTasks
Algorithm Steps - Section in class topics.divideconquer.search.BinarySearch
Algorithm Steps - Section in class topics.sorting.bubble.Bubble
Algorithm Steps - Section in class topics.sorting.heapsort.Heapsort
Algorithm Steps - Section in class topics.sorting.insertion.BinaryInsertion
Algorithm Steps - Section in class topics.sorting.insertion.DirectInsertion
Algorithm Steps - Section in class topics.sorting.mergesort.Mergesort
Algorithm Steps - Section in class topics.sorting.quicksort.Quicksort
Algorithm Steps - Section in class topics.sorting.radix.Radix
Algorithm Steps - Section in class topics.sorting.shellsort.Shellsort
Algorithm Strategy - Section in class topics.dynamic.river.RiverTravel
Architecture & Complexity - Section in class topics.branchandbound.utils.threads.HeapThreads
ArrayDeque Demonstration - Section in class topics.foundation.structures.ArrayDequeExample
ArrayDequeExample - Class in topics.foundation.structures: ArrayDeque Demonstration
ArrayDequeExample() - Constructor for class topics.foundation.structures.ArrayDequeExample
ArrayList Demonstration - Section in class topics.foundation.structures.ArrayListExample
ArrayListExample - Class in topics.foundation.structures: ArrayList Demonstration
ArrayListExample() - Constructor for class topics.foundation.structures.ArrayListExample
Array Summation - Section in class topics.foundation.sum.GetAdditionFromList
assignAgentsToTasks() - Method in class topics.greedy.agents.AgentsTasks: Strategy 2: Column-Minima (Task-Driven)
assignBasic(List, List) - Method in class topics.greedy.rapiddefense.RapidDefense: 1.
AssignmentState - Class in topics.branchandbound.agents: Represents a distinct state within the Branch and Bound execution tree for the Task Assignment problem.
AssignmentState(int, int[][]) - Constructor for class topics.branchandbound.agents.AssignmentState: Constructs the Root Node of the state space tree, representing the initial unassigned state of the system.
AssignmentState(AssignmentState, int) - Constructor for class topics.branchandbound.agents.AssignmentState: Constructs a child state derived from a parent node by assigning a specific task to the next available agent.
assignQuick(List, List) - Method in class topics.greedy.rapiddefense.RapidDefense: 2.
assignTasksToAgents() - Method in class topics.greedy.agents.AgentsTasks: Strategy 1: Row-Minima (Agent-Driven)

B

backtrack(int) - Method in class topics.backtracking.paths.PathAll
backtrack(int) - Method in class topics.backtracking.paths.PathBest
backtrack(int) - Method in class topics.backtracking.paths.PathBestPruning
backtrack(int) - Method in class topics.backtracking.paths.PathSimple
backtrack(int) - Method in class topics.backtracking.paths.PathWorst
backtrack(int) - Method in class topics.backtracking.tsp.CyclesAll
backtrack(int) - Method in class topics.backtracking.tsp.HamiltonianAll: Core backtracking logic following the Choose-Explore-Unchoose paradigm.
backtrack(int) - Method in class topics.backtracking.tsp.Salesman
backtrack(int) - Method in class topics.backtracking.tsp.SalesmanPruning
backtracking() - Method in class topics.backtracking.paths.PathSimple
backtracking() - Method in class topics.backtracking.tsp.HamiltonianAll
backtracking(int) - Static method in class topics.backtracking.permutations.PermutationsTimes
bestCost - Variable in class topics.backtracking.paths.PathBest
bestCost - Variable in class topics.backtracking.tsp.Salesman
bestLength - Variable in class topics.backtracking.paths.PathBest
bestNode - Variable in class topics.branchandbound.utils.BranchAndBound: The node representing the optimal valid configuration discovered during execution.
bestNode - Static variable in class topics.branchandbound.utils.threads.BranchAndBoundThreads: The node representing the optimal valid configuration discovered globally across all threads.
bestPath - Variable in class topics.backtracking.paths.PathBest
bestPath - Variable in class topics.backtracking.tsp.Salesman
BidirectionalBubble - Class in topics.sorting.bubble: Bidirectional Bubble Sort (Cocktail Shaker Sort)
BidirectionalBubble() - Constructor for class topics.sorting.bubble.BidirectionalBubble
Bidirectional Bubble Sort (Cocktail Shaker Sort) - Section in class topics.sorting.bubble.BidirectionalBubble
BidirectionalBubbleTest - Class in topics.sorting.bubble: Validation Suite for Bidirectional Bubble Sort
BidirectionalBubbleTest() - Constructor for class topics.sorting.bubble.BidirectionalBubbleTest
BinaryInsertion - Class in topics.sorting.insertion: Binary Insertion Sort
BinaryInsertion() - Constructor for class topics.sorting.insertion.BinaryInsertion
Binary Insertion Sort - Section in class topics.sorting.insertion.BinaryInsertion
BinaryInsertionTest - Class in topics.sorting.insertion: Validation Suite for Binary Insertion Sort
BinaryInsertionTest() - Constructor for class topics.sorting.insertion.BinaryInsertionTest
BinarySearch - Class in topics.divideconquer.search: Binary Search
BinarySearch() - Constructor for class topics.divideconquer.search.BinarySearch
Binary Search - Section in class topics.divideconquer.search.BinarySearch
binarySearchIterative(int[], int) - Method in class topics.divideconquer.search.BinarySearch: Iterative implementation of Binary Search.
binarySearchRecursive(int[], int) - Method in class topics.divideconquer.search.BinarySearch: Recursive implementation of Binary Search.
BinarySearchTest - Class in topics.divideconquer.search: Validation Suite for Binary Search
BinarySearchTest() - Constructor for class topics.divideconquer.search.BinarySearchTest
BoardState - Class in topics.branchandbound.rectangles: Represents a distinct physical configuration of the board within the state space tree.
BoardState(int[][], List, int, UUID) - Constructor for class topics.branchandbound.rectangles.BoardState: Constructs a child node representing a subsequent placement state.
BoardState(int, List) - Constructor for class topics.branchandbound.rectangles.BoardState: Constructs the root node representing an empty board.
Board State for Rectangle Placement - Section in class topics.branchandbound.rectangles.Game
Bounding Principle - Section in class topics.backtracking.tsp.SalesmanPruning
branchAndBound(Node) - Method in class topics.branchandbound.stringinterleaving.StringInterleavingGenerator
branchAndBound(Node) - Method in class topics.branchandbound.utils.BranchAndBound: Executes the primary Branch and Bound systemic loop.
branchAndBound(Node, int) - Method in class topics.branchandbound.utils.threads.BranchAndBoundThreads: Executes the multithreaded Branch and Bound systemic loop.
BranchAndBound - Class in topics.branchandbound.utils: Branch and Bound Execution Engine
BranchAndBound() - Constructor for class topics.branchandbound.utils.BranchAndBound: Initializes the fundamental memory structures required for the execution engine.
Branch and Bound Execution Engine - Section in class topics.branchandbound.utils.BranchAndBound
BranchAndBoundThreads - Class in topics.branchandbound.utils.threads: Concurrent Branch and Bound Execution Engine
BranchAndBoundThreads() - Constructor for class topics.branchandbound.utils.threads.BranchAndBoundThreads: Initializes the concurrent memory structures required for the execution engine.
Bubble - Class in topics.sorting.bubble: Bubble Sort (Left-Bubbling)
Bubble() - Constructor for class topics.sorting.bubble.Bubble
BubbleSentinel - Class in topics.sorting.bubble: Bubble Sort (Optimized with Sentinel)
BubbleSentinel() - Constructor for class topics.sorting.bubble.BubbleSentinel
BubbleSentinelTest - Class in topics.sorting.bubble: Validation Suite for Optimized Bubble Sort (Sentinel)
BubbleSentinelTest() - Constructor for class topics.sorting.bubble.BubbleSentinelTest
Bubble Sort (Left-Bubbling) - Section in class topics.sorting.bubble.Bubble
Bubble Sort (Optimized with Sentinel) - Section in class topics.sorting.bubble.BubbleSentinel
BubbleTest - Class in topics.sorting.bubble: Validation Suite for Bubble Sort
BubbleTest() - Constructor for class topics.sorting.bubble.BubbleTest

C

calculateCoins(int, int[]) - Method in class topics.greedy.change.Change: Calculates the change using a purely greedy approach.
calculateColumnStrategyCost(int[]) - Method in class topics.greedy.agents.AgentsTasks: Computes total cost incurred by Strategy 2 (Column-Minima).
calculateHeuristicValue() - Method in class topics.branchandbound.agents.AssignmentState: Calculates the lower bound heuristic estimate for this partial assignment.
calculateHeuristicValue() - Method in class topics.branchandbound.eightpuzzle.PuzzleState: Computes the lower-bound heuristic value.
calculateHeuristicValue() - Method in class topics.branchandbound.rectangles.BoardState: Computes the bounding box area of all placed pieces.
calculateHeuristicValue() - Method in class topics.branchandbound.rectangles.Game: Computes the bounding box area of all placed pieces.
calculateHeuristicValue() - Method in class topics.branchandbound.stringinterleaving.InterleavingNode: Heuristic: Distance to completion.
calculateHeuristicValue() - Method in class topics.branchandbound.utils.Node: Executes the mathematical formulation to compute the specific lower-bound heuristic estimate for this state configuration.
calculateMinimumCosts(int[][]) - Method in class topics.dynamic.river.RiverTravel: Calculates the minimum cost matrix for traveling between all pairs of docks.
calculateModeNaive(int[]) - Method in class topics.divideconquer.mode.Mode: 1.
calculateModeSorting(int[]) - Method in class topics.divideconquer.mode.Mode: 2.
calculateOptimalWaitTime(int[], int) - Method in class topics.greedy.plumber.MultiPlumber: Calculates the optimal total waiting time using Greedy principles.
calculateRandomWaitTime(int[], int) - Method in class topics.greedy.plumber.MultiPlumber: Simulates a chaotic, unoptimized assignment by distributing tasks randomly.
calculateRowStrategyCost(int[]) - Method in class topics.greedy.agents.AgentsTasks: Computes total cost incurred by Strategy 1 (Row-Minima).
change(int, int[]) - Method in class topics.dynamic.change.Change: Determines the minimum coins required for the target amount using a 1D DP table.
Change - Class in topics.dynamic.change: Coin Change
Change - Class in topics.greedy.change: Coin Change
Change() - Constructor for class topics.dynamic.change.Change
Change() - Constructor for class topics.greedy.change.Change
ChangeTest - Class in topics.dynamic.change: Validation Suite for Dynamic Programming Coin Change
ChangeTest - Class in topics.greedy.change: Validation Suite for Greedy Coin Change
ChangeTest() - Constructor for class topics.dynamic.change.ChangeTest
ChangeTest() - Constructor for class topics.greedy.change.ChangeTest
Cheaper Travel on the River - Section in class topics.dynamic.river.RiverTravel
ChessHorse - Class in topics.greedy.knighttour: Knight's Tour (Warnsdorff's Heuristic)
ChessHorse(int) - Constructor for class topics.greedy.knighttour.ChessHorse: Constructs the chessboard.
ChessHorseAll - Class in topics.backtracking.knighttour: The Knight's Tour (All Solutions)
ChessHorseAll(int, int, int) - Constructor for class topics.backtracking.knighttour.ChessHorseAll: Initializes the chessboard and sets up the starting position.
ChessHorseAllTest - Class in topics.backtracking.knighttour: Test Suite for ChessHorseAll
ChessHorseAllTest() - Constructor for class topics.backtracking.knighttour.ChessHorseAllTest
ChessHorseOne - Class in topics.backtracking.knighttour: The Knight's Tour (First Solution)
ChessHorseOne(int, int, int) - Constructor for class topics.backtracking.knighttour.ChessHorseOne: Initializes the chessboard and sets up the starting position.
ChessHorseOneTest - Class in topics.backtracking.knighttour: Test Suite for ChessHorseOne
ChessHorseOneTest() - Constructor for class topics.backtracking.knighttour.ChessHorseOneTest
ChessHorseSimpleHeuristic - Class in topics.greedy.knighttour: Knight's Tour
ChessHorseSimpleHeuristic(int) - Constructor for class topics.greedy.knighttour.ChessHorseSimpleHeuristic: Constructs the chessboard.
ChessHorseSimpleHeuristicTest - Class in topics.greedy.knighttour: Validation Suite for Knight's Tour (Naive Greedy)
ChessHorseSimpleHeuristicTest() - Constructor for class topics.greedy.knighttour.ChessHorseSimpleHeuristicTest
ChessHorseTest - Class in topics.greedy.knighttour: Validation Suite for Knight's Tour (Greedy)
ChessHorseTest() - Constructor for class topics.greedy.knighttour.ChessHorseTest
ChessQueensAll - Class in topics.backtracking.nqueens: The N-Queens (All Solutions)
ChessQueensAll(int) - Constructor for class topics.backtracking.nqueens.ChessQueensAll: Initializes the N-Queens solver and allocates the necessary memory for tracking the state of the board.
ChessQueensAllTest - Class in topics.backtracking.nqueens: Test Suite for ChessQueensAll
ChessQueensAllTest() - Constructor for class topics.backtracking.nqueens.ChessQueensAllTest
ChessQueensOne - Class in topics.backtracking.nqueens: The N-Queens (First Solution)
ChessQueensOne(int) - Constructor for class topics.backtracking.nqueens.ChessQueensOne: Initializes the N-Queens solver and allocates the necessary memory for tracking the state of the board in constant time.
ChessQueensOneTest - Class in topics.backtracking.nqueens: Test Suite for ChessQueensOne
ChessQueensOneTest() - Constructor for class topics.backtracking.nqueens.ChessQueensOneTest
City - Class in topics.greedy.rapiddefense: Represents a city invaded by enemies.
City(int, int) - Constructor for class topics.greedy.rapiddefense.City
clear() - Method in class topics.branchandbound.utils.threads.HeapThreads: Flushes all active nodes from the priority queue.
Coin Change - Section in class topics.dynamic.change.Change
Coin Change - Section in class topics.greedy.change.Change
Combinations - Class in topics.dynamic.combinations: Combinations (n choose k)
Combinations() - Constructor for class topics.dynamic.combinations.Combinations
Combinations (n choose k) - Section in class topics.dynamic.combinations.Combinations
combinationsDP(int, int) - Method in class topics.dynamic.combinations.Combinations: Calculates combinations using Dynamic Programming (Bottom-Up).
combinationsRecursive(int, int) - Method in class topics.dynamic.combinations.Combinations: Calculates combinations using Naive Recursion.
CombinationsTest - Class in topics.dynamic.combinations: Validation Suite for Combinations
CombinationsTest() - Constructor for class topics.dynamic.combinations.CombinationsTest
compareTo(Node) - Method in class topics.branchandbound.utils.Node: Defines the prioritization logic for the execution engine's priority queue.
compareTo(City) - Method in class topics.greedy.rapiddefense.City
compareTo(Defender) - Method in class topics.greedy.rapiddefense.Defender
Complexity - Section in class topics.backtracking.agents.AgentsTasks
Complexity - Section in class topics.backtracking.knighttour.ChessHorseAll
Complexity - Section in class topics.backtracking.knighttour.ChessHorseOne
Complexity - Section in class topics.backtracking.nqueens.ChessQueensAll
Complexity - Section in class topics.backtracking.nqueens.ChessQueensOne
Complexity - Section in class topics.backtracking.paths.PathSimple
Complexity - Section in class topics.backtracking.permutations.Permutations
Complexity - Section in class topics.backtracking.subsetsum.SubsetsGivenSum
Complexity - Section in class topics.branchandbound.agents.AssignmentState
Complexity - Section in class topics.branchandbound.eightpuzzle.PuzzleState
Complexity - Section in class topics.branchandbound.rectangles.RectanglesPlacement
Complexity - Section in class topics.branchandbound.rectangles.RectanglesPlacementThreads
Complexity - Section in class topics.branchandbound.utils.threads.WorkerThread
Complexity - Section in class topics.foundation.factorial.Factorial
Complexity - Section in class topics.foundation.maximum.GetMaximumFromList
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct2
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct3
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct4
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct5
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct6
Complexity - Section in class topics.foundation.maxpairwise.MaxPairWiseProductRandomNumbers
Complexity - Section in class topics.foundation.structures.ArrayDequeExample
Complexity - Section in class topics.foundation.structures.ArrayListExample
Complexity - Section in class topics.foundation.structures.HashSetExample
Complexity - Section in class topics.foundation.structures.LinkedHashSetExample
Complexity - Section in class topics.foundation.structures.LinkedListExample
Complexity - Section in class topics.foundation.structures.PriorityQueueExample
Complexity - Section in class topics.foundation.structures.StackExample
Complexity - Section in class topics.foundation.structures.TreeSetExample
Complexity - Section in class topics.foundation.structures.VectorExample
Complexity - Section in class topics.foundation.sum.GetAdditionFromList
Complexity - Section in class topics.parallel.fibonacci.FibonacciAlgorithm
Complexity - Section in class topics.parallel.square.RecursiveActionSquare
Complexity - Section in class topics.parallel.sum.RecursiveTaskSum
Complexity - Section in topics.divideconquer.median.Util.partition(int[], int, int)
Complexity Analysis - Section in class topics.backtracking.tsp.HamiltonianAll
Complexity Analysis - Section in class topics.divideconquer.search.BinarySearch
Complexity Analysis - Section in class topics.divideconquer.search.SequentialSearch
Complexity Analysis - Section in class topics.dynamic.change.Change
Complexity Analysis - Section in class topics.dynamic.knapsack.Knapsack01
Complexity Analysis - Section in class topics.dynamic.river.RiverTravel
Complexity Analysis - Section in class topics.sorting.bubble.BidirectionalBubble
Complexity Analysis - Section in class topics.sorting.bubble.Bubble
Complexity Analysis - Section in class topics.sorting.bubble.BubbleSentinel
Complexity Analysis - Section in class topics.sorting.heapsort.Heapsort
Complexity Analysis - Section in class topics.sorting.insertion.BinaryInsertion
Complexity Analysis - Section in class topics.sorting.insertion.DirectInsertion
Complexity Analysis - Section in class topics.sorting.mergesort.Mergesort
Complexity Analysis - Section in class topics.sorting.quicksort.Quicksort
Complexity Analysis - Section in class topics.sorting.radix.Radix
Complexity Analysis - Section in class topics.sorting.selection.DirectSelection
Complexity Analysis - Section in class topics.sorting.shellsort.Shellsort
Complexity Analysis (DP Version) - Section in class topics.dynamic.combinations.Combinations
compute() - Method in class topics.foundation.maxpairwise.MaxPairWiseProduct: Computes the mathematical product of the predefined integers.
compute() - Method in class topics.foundation.maxpairwise.MaxPairWiseProduct2: Computes the mathematical product of the natively safe 64-bit integers.
compute() - Method in class topics.foundation.maxpairwise.MaxPairWiseProduct3: Computes the mathematical product iteratively by comparing every unique pair.
compute() - Method in class topics.foundation.maxpairwise.MaxPairWiseProduct4: Computes the maximum mathematical product by sorting the array descending and multiplying the top two absolute maximums.
compute() - Method in class topics.foundation.maxpairwise.MaxPairWiseProduct5: Computes the maximum mathematical product by sorting the array in its default ascending order and multiplying the two final elements.
compute() - Method in class topics.foundation.maxpairwise.MaxPairWiseProduct6: Computes the maximum mathematical product natively by tracking the top two largest integers during a single iteration sequence.
compute() - Method in class topics.parallel.cuberoot.RecursiveActionComparison
compute() - Method in class topics.parallel.fibonacci.FibonacciTask: The primary computation logic that dictates whether to fork the problem or solve it sequentially.
compute() - Method in class topics.parallel.fileprocessing.FileProcessingTask
compute() - Method in class topics.parallel.square.RecursiveActionSquare
compute() - Method in class topics.parallel.sum.RecursiveTaskSum
compute(int[][], int[][]) - Method in class topics.dynamic.floyd.FloydWarshall: Executes the Floyd-Warshall algorithm.
computeSafe(int) - Method in class topics.foundation.factorial.Factorial: Computes the factorial recursively with strict negative boundary validation.
computeUnsafe(int) - Method in class topics.foundation.factorial.Factorial: Computes the factorial recursively without validating boundaries.
Concurrent Branch and Bound Execution Engine - Section in class topics.branchandbound.utils.threads.BranchAndBoundThreads
Concurrent Performance Benchmark (Rectangle Placement) - Section in class topics.branchandbound.rectangles.RectanglesPlacementTestTimeThreads
Concurrent State Space Queue (Heap) - Section in class topics.branchandbound.utils.threads.HeapThreads
Concurrent Worker Thread - Section in class topics.branchandbound.utils.threads.WorkerThread
cost - Variable in class topics.backtracking.paths.PathSimple
cost - Variable in class topics.backtracking.tsp.HamiltonianAll
counter - Static variable in class topics.backtracking.permutations.PermutationsTimes
countVictories(List, List) - Method in class topics.greedy.rapiddefense.RapidDefense: Calculates the total number of victories based on the current assignment state.
createEmpty() - Method in class topics.branchandbound.utils.Heap: Clears the priority queue
createExampleGraph() - Static method in class topics.backtracking.tsp.CyclesAllTest
CyclesAll - Class in topics.backtracking.tsp: Simple Cycles of a Node
CyclesAll(int, int, int[][]) - Constructor for class topics.backtracking.tsp.CyclesAll
CyclesAllTest - Class in topics.backtracking.tsp
CyclesAllTest() - Constructor for class topics.backtracking.tsp.CyclesAllTest

D

2. Divide & Conquer by Subtraction - Section in topics.divideconquer.vectorsum.VectorSum.sumRecursiveSubtraction(int[])
2. Dynamic Programming Approach (Tabulation) - Section in topics.dynamic.fibonacci.Fibonacci.fibonacciDP(int)
3. Divide & Conquer Approach (Tournament/Pairing Method) - Section in topics.divideconquer.majoritarian.MajoritarianElement.hasMajorityDivideAndConquer(int[])
3. Divide & Conquer Approach O(N log N) - Section in topics.divideconquer.maxsum.MaxSum.maxSubarrayDivideAndConquer(int[])
3. Divide & Conquer by Division - Section in topics.divideconquer.vectorsum.VectorSum.sumRecursiveDivision(int[])
Defender - Class in topics.greedy.rapiddefense: Represents a team of defenders available for deployment.
Defender(int, int) - Constructor for class topics.greedy.rapiddefense.Defender
depth - Variable in class topics.branchandbound.utils.Node: The topological depth of this state within the execution tree.
DirectInsertion - Class in topics.sorting.insertion: Direct Insertion Sort
DirectInsertion() - Constructor for class topics.sorting.insertion.DirectInsertion
Direct Insertion Sort - Section in class topics.sorting.insertion.DirectInsertion
DirectInsertionTest - Class in topics.sorting.insertion: Validation Suite for Direct Insertion Sort
DirectInsertionTest() - Constructor for class topics.sorting.insertion.DirectInsertionTest
DirectSelection - Class in topics.sorting.selection: Direct Selection Sort
DirectSelection() - Constructor for class topics.sorting.selection.DirectSelection
Direct Selection Sort - Section in class topics.sorting.selection.DirectSelection
DirectSelectionTest - Class in topics.sorting.selection: Validation Suite for Direct Selection Sort
DirectSelectionTest() - Constructor for class topics.sorting.selection.DirectSelectionTest
DiskPacking - Class in topics.greedy.disk: Disk Packing
DiskPacking() - Constructor for class topics.greedy.disk.DiskPacking
Disk Packing - Section in class topics.greedy.disk.DiskPacking
DiskPackingTest - Class in topics.greedy.disk: Validation Suite for Disk Packing Greedy Strategies
DiskPackingTest() - Constructor for class topics.greedy.disk.DiskPackingTest
Divide & Conquer Strategy by Subtraction - Section in class topics.divideconquer.search.SequentialSearch
Divide & Conquer Utility - Section in class topics.divideconquer.median.Util
Dynamic Programming Solution (Pascal's Triangle) - Section in class topics.dynamic.combinations.Combinations
Dynamic Programming Transition Matrix (2D) - Section in class topics.dynamic.knapsack.Knapsack01

E

Educational Note - Section in class topics.divideconquer.maxsum.MaxSumBenchmark
Educational Purpose - Section in class topics.greedy.knighttour.ChessHorseSimpleHeuristic
Educational Purpose: The Greedy Failure - Section in class topics.greedy.knapsack.Knapsack01
EightPuzzle - Class in topics.branchandbound.eightpuzzle: The 8-Puzzle
EightPuzzle(HeuristicType, int[]) - Constructor for class topics.branchandbound.eightpuzzle.EightPuzzle: Initializes the puzzle solver and builds the execution tree root.
EightPuzzleTest - Class in topics.branchandbound.eightpuzzle: Test Suite for the 8-Puzzle Solver
EightPuzzleTest() - Constructor for class topics.branchandbound.eightpuzzle.EightPuzzleTest
Empirical Analysis: Pruning Impact - Section in class topics.backtracking.paths.PathBestTimes
Empirical Complexity Analysis: Floyd-Warshall - Section in class topics.dynamic.floyd.FloydWarshallTimes
Empirical Complexity Analysis: TSP Optimizations - Section in class topics.backtracking.tsp.SalesmanTimes
Empirical Runtime Analysis - Section in class topics.greedy.rapiddefense.RapidDefenseBenchmark
Empirical Runtime Analysis for Agent Task Assignment - Section in class topics.greedy.agents.AgentsTasksDifferentSizesTimes
Empirical Runtime Analysis for Backtracking - Section in class topics.backtracking.agents.AgentsTasksTimes
Empirical Runtime Analysis for Maximum Subarray Sum - Section in class topics.divideconquer.maxsum.MaxSumBenchmark
empty() - Method in class topics.branchandbound.utils.Heap: Checks whether the priority queue is empty
equals(Object) - Method in class topics.branchandbound.utils.Node: Evaluates topological equivalence between this state and another object.
equals(Object) - Method in record class topics.greedy.tsp.SalesmanSolution: Indicates whether some other object is "equal to" this one.
estimateBest() - Method in class topics.branchandbound.utils.Heap: Gets the heuristic of the best node in the priority queue
estimateBest() - Method in class topics.branchandbound.utils.threads.HeapThreads: Peeks at the most promising active node to estimate the current best theoretical outcome without removing it from the queue.
Euclidean Algorithm - Section in topics.divideconquer.gcd.GCD.euclideanGCD(long, long)
euclideanGCD(long, long) - Method in class topics.divideconquer.gcd.GCD: Euclidean Algorithm
Even Length Definition - Section in class topics.divideconquer.median.Median
Exhaustive Search for Hamiltonian Cycles - Section in class topics.backtracking.tsp.HamiltonianAll
expand() - Method in class topics.branchandbound.agents.AssignmentState: Generates all mathematically valid mathematical combinations extending from the current state.
expand() - Method in class topics.branchandbound.eightpuzzle.PuzzleState: Generates all mathematically and physically valid child states.
expand() - Method in class topics.branchandbound.rectangles.BoardState: Generates all mathematically valid mathematical configurations extending from the current state by placing the next available piece.
expand() - Method in class topics.branchandbound.rectangles.Game: Generates all mathematically valid configurations extending from the current state by placing the next available piece.
expand() - Method in class topics.branchandbound.stringinterleaving.InterleavingNode
expand() - Method in class topics.branchandbound.utils.Node: Generates all mathematically valid state configurations extending from this specific topological juncture.
extractBestNode() - Method in class topics.branchandbound.utils.Heap: Retrieves and removes the first element of the priority queue
extractBestNode() - Method in class topics.branchandbound.utils.threads.HeapThreads: Thread-safe retrieval and removal of the highest-priority node from the frontier.
extractUsedNodesFrom(Node) - Method in class topics.branchandbound.utils.Heap: Extracts the nodes from a specific node (e.g., the solution) to the root node
extractUsedNodesFrom(Node) - Method in class topics.branchandbound.utils.threads.HeapThreads: Traces the ancestral lineage of a specific node back to the root of the execution tree.

F

Factorial - Class in topics.divideconquer.factorial: Factorial Calculation
Factorial - Class in topics.foundation.factorial: Factorial Computation
Factorial() - Constructor for class topics.divideconquer.factorial.Factorial
Factorial() - Constructor for class topics.foundation.factorial.Factorial
Factorial Calculation - Section in class topics.divideconquer.factorial.Factorial
Factorial Computation - Section in class topics.foundation.factorial.Factorial
factorialIterative(int) - Method in class topics.divideconquer.factorial.Factorial: Iterative implementation using a linear accumulator.
factorialRecursive(int) - Method in class topics.divideconquer.factorial.Factorial: Recursive implementation demonstrating Divide and Conquer by Subtraction.
FactorialTest - Class in topics.divideconquer.factorial: Validation Suite for Factorial
FactorialTest - Class in topics.foundation.factorial: Validation Suite for Factorial Algorithm
FactorialTest() - Constructor for class topics.divideconquer.factorial.FactorialTest
FactorialTest() - Constructor for class topics.foundation.factorial.FactorialTest
Fibonacci - Class in topics.divideconquer.fibonacci: Fibonacci Sequence
Fibonacci - Class in topics.dynamic.fibonacci: Fibonacci Sequence
Fibonacci() - Constructor for class topics.divideconquer.fibonacci.Fibonacci
Fibonacci() - Constructor for class topics.dynamic.fibonacci.Fibonacci
FibonacciAlgorithm - Class in topics.parallel.fibonacci: Naive Recursive Fibonacci
FibonacciAlgorithm(int) - Constructor for class topics.parallel.fibonacci.FibonacciAlgorithm: Initializes the algorithm with the target sequence index.
FibonacciAlgorithmTest - Class in topics.parallel.fibonacci: Validation Suite for Naive Fibonacci
FibonacciAlgorithmTest() - Constructor for class topics.parallel.fibonacci.FibonacciAlgorithmTest
fibonacciArray(int) - Method in class topics.divideconquer.fibonacci.Fibonacci: 2.
fibonacciDP(int) - Method in class topics.dynamic.fibonacci.Fibonacci: 2.
fibonacciIterative(int) - Method in class topics.divideconquer.fibonacci.Fibonacci: 1.
fibonacciIterative(int) - Method in class topics.dynamic.fibonacci.Fibonacci: 1.
fibonacciLogarithmic(int) - Method in class topics.divideconquer.fibonacci.Fibonacci: 5.
fibonacciLogarithmic(int) - Method in class topics.dynamic.fibonacci.Fibonacci: 5.
fibonacciNaiveRecursive(int) - Method in class topics.divideconquer.fibonacci.Fibonacci: 4.
fibonacciNaiveRecursive(int) - Method in class topics.dynamic.fibonacci.Fibonacci: 4.
Fibonacci Sequence - Section in class topics.divideconquer.fibonacci.Fibonacci
Fibonacci Sequence - Section in class topics.dynamic.fibonacci.Fibonacci
fibonacciTailRecursive(int) - Method in class topics.divideconquer.fibonacci.Fibonacci: 3.
fibonacciTailRecursive(int) - Method in class topics.dynamic.fibonacci.Fibonacci: 3.
FibonacciTask - Class in topics.parallel.fibonacci: Parallel Fibonacci (Fork/Join)
FibonacciTask(int) - Constructor for class topics.parallel.fibonacci.FibonacciTask: Initializes the parallel task.
FibonacciTaskTest - Class in topics.parallel.fibonacci: Validation Suite for Parallel Fibonacci
FibonacciTaskTest() - Constructor for class topics.parallel.fibonacci.FibonacciTaskTest
FibonacciTest - Class in topics.divideconquer.fibonacci: Validation Suite for Divide invalid input: '&' Conquer Fibonacci
FibonacciTest - Class in topics.dynamic.fibonacci: Validation Suite for Fibonacci Implementations
FibonacciTest() - Constructor for class topics.divideconquer.fibonacci.FibonacciTest
FibonacciTest() - Constructor for class topics.dynamic.fibonacci.FibonacciTest
FileProcessingTask - Class in topics.parallel.fileprocessing: Parallel File Processing (Fork/Join)
FileProcessingTask(Path) - Constructor for class topics.parallel.fileprocessing.FileProcessingTask: Root Constructor: Initializes the task by scanning the target directory.
FileProcessingTaskTest - Class in topics.parallel.fileprocessing: Validation Suite for Parallel File Processing
FileProcessingTaskTest() - Constructor for class topics.parallel.fileprocessing.FileProcessingTaskTest
fillKnapsack(int, int[], int[]) - Method in class topics.greedy.knapsack.FractionalKnapsack: Calculates the optimal fractional distribution of items to maximize value.
fillKnapsackGreedily(int, int[], int[]) - Method in class topics.greedy.knapsack.Knapsack01: Attempts to pack the knapsack greedily.
fillMatrixRandomly(int[][]) - Static method in class topics.greedy.agents.AgentsTasksRandomValues: Fills a square matrix with random costs between 1 and 999.
Financial Software Note - Section in class topics.greedy.change.Change
findPosMax(int[], int) - Static method in class topics.sorting.utils.Util: Locates the position of the largest element within a specific sub-array.
findPosMin(int[], int) - Static method in class topics.sorting.utils.Util: Locates the position of the smallest element within a specific sub-array.
FloydWarshall - Class in topics.dynamic.floyd: Floyd-Warshall (All-Pairs Shortest Path)
FloydWarshall() - Constructor for class topics.dynamic.floyd.FloydWarshall
Floyd-Warshall (All-Pairs Shortest Path) - Section in class topics.dynamic.floyd.FloydWarshall
FloydWarshallTest - Class in topics.dynamic.floyd: Validation Suite for Floyd-Warshall
FloydWarshallTest() - Constructor for class topics.dynamic.floyd.FloydWarshallTest
FloydWarshallTimes - Class in topics.dynamic.floyd: Empirical Complexity Analysis: Floyd-Warshall
FloydWarshallTimes() - Constructor for class topics.dynamic.floyd.FloydWarshallTimes
FractionalKnapsack - Class in topics.greedy.knapsack: Fractional Knapsack
FractionalKnapsack() - Constructor for class topics.greedy.knapsack.FractionalKnapsack
Fractional Knapsack - Section in class topics.greedy.knapsack.FractionalKnapsack
FractionalKnapsackTest - Class in topics.greedy.knapsack: Validation Suite for Fractional Knapsack
FractionalKnapsackTest() - Constructor for class topics.greedy.knapsack.FractionalKnapsackTest

G

Game - Class in topics.branchandbound.rectangles: Board State for Rectangle Placement
Game(int[][], List, int, UUID) - Constructor for class topics.branchandbound.rectangles.Game: Constructs a child node representing a subsequent placement state.
Game(int, List) - Constructor for class topics.branchandbound.rectangles.Game: Constructs the root node representing an empty board.
GCD - Class in topics.divideconquer.gcd: Greatest Common Divisor (GCD)
GCD() - Constructor for class topics.divideconquer.gcd.GCD
GCDTest - Class in topics.divideconquer.gcd: Validation Suite for Greatest Common Divisor
GCDTest() - Constructor for class topics.divideconquer.gcd.GCDTest
generateAll() - Method in class topics.backtracking.permutations.Permutations: Triggers the recursive backtracking engine to generate all permutations.
generateAllInterleavings(String, String) - Method in class topics.backtracking.stringinterleaving.StringInterleavingGenerator: Generates all possible interleavings of two strings.
generateRandomWord(int) - Static method in class topics.branchandbound.stringinterleaving.StringInterleavingBenchmark: Generates a random lowercase string of a specific length using modern ThreadLocalRandom.
GetAdditionFromList - Class in topics.foundation.sum: Array Summation
GetAdditionFromList() - Constructor for class topics.foundation.sum.GetAdditionFromList
GetAdditionFromListTest - Class in topics.foundation.sum: Test Suite for Array Summation
GetAdditionFromListTest() - Constructor for class topics.foundation.sum.GetAdditionFromListTest
getBestCost() - Method in class topics.backtracking.paths.PathBest
getBestCost() - Method in class topics.backtracking.tsp.Salesman
getBestNode() - Method in class topics.branchandbound.utils.BranchAndBound: Retrieves the node encapsulating the mathematically optimal path or configuration.
getBestNode() - Method in class topics.branchandbound.utils.threads.BranchAndBoundThreads: Retrieves the node encapsulating the mathematically optimal path or configuration.
getBestPath() - Method in class topics.backtracking.paths.PathBest
getBestPath() - Method in class topics.backtracking.tsp.Salesman
getDefenderTeamId() - Method in class topics.greedy.rapiddefense.City
getDepth() - Method in class topics.branchandbound.utils.Node: Retrieves the execution depth of this state.
getHeuristicValue() - Method in class topics.branchandbound.utils.Node: Retrieves the optimistic heuristic evaluation cost of this state.
getId() - Method in class topics.branchandbound.utils.Node: Retrieves the unique identifier of this node.
getId() - Method in class topics.greedy.rapiddefense.City
getId() - Method in class topics.greedy.rapiddefense.Defender
GetMaximumFromList - Class in topics.foundation.maximum: Maximum Value Extraction
GetMaximumFromList() - Constructor for class topics.foundation.maximum.GetMaximumFromList
GetMaximumFromListTest - Class in topics.foundation.maximum: Validation Suite for Maximum Value Extraction
GetMaximumFromListTest() - Constructor for class topics.foundation.maximum.GetMaximumFromListTest
getNumberDefenders() - Method in class topics.greedy.rapiddefense.Defender
getNumberEnemies() - Method in class topics.greedy.rapiddefense.City
getNumberSolutions() - Method in class topics.backtracking.paths.PathSimple
getNumberSolutions() - Method in class topics.backtracking.tsp.HamiltonianAll
getOptimalCost() - Method in class topics.backtracking.agents.AgentsTasks: Returns the optimal cost calculated by the solve() method.
getOptimalTotalTimeOfWait() - Method in class topics.greedy.plumber.Plumber: Calculates minimum possible total waiting time (The Greedy Optimum).
getParentId() - Method in class topics.branchandbound.utils.Node: Retrieves the unique identifier of the parent node.
getPathString(int) - Method in class topics.backtracking.paths.PathSimple
getPermutationCount() - Method in class topics.backtracking.permutations.Permutations: Retrieves the total count of permutations generated by the algorithm.
getRootNode() - Method in class topics.branchandbound.utils.BranchAndBound: Retrieves the foundational starting state of the problem.
getRootNode() - Method in class topics.branchandbound.utils.threads.BranchAndBoundThreads: Retrieves the foundational starting state of the problem.
getSolutionCount() - Method in class topics.backtracking.knighttour.ChessHorseAll: Retrieves the total number of solutions discovered after the search completes.
getSolutionCount() - Method in class topics.backtracking.nqueens.ChessQueensAll: Retrieves the total number of valid board configurations discovered.
getSolutionCount() - Method in class topics.backtracking.subsetsum.SubsetsGivenSum: Retrieves the total count of valid subsets discovered by the algorithm.
getSolutionCount() - Method in class topics.branchandbound.stringinterleaving.StringInterleavingGenerator
getTotalTimeOfWait() - Method in class topics.greedy.plumber.Plumber: Calculates total waiting time for the current task order.
getWorstCost() - Method in class topics.backtracking.paths.PathWorst
getWorstPath() - Method in class topics.backtracking.paths.PathWorst
globalUpperBound - Variable in class topics.branchandbound.utils.BranchAndBound: The global upper bound metric used to prune paths mathematically incapable of yielding a better outcome than the currently discovered optimal solution.
globalUpperBound - Static variable in class topics.branchandbound.utils.threads.BranchAndBoundThreads: The global upper bound metric used to prune paths mathematically incapable of yielding a better outcome.
Greatest Common Divisor (GCD) - Section in class topics.divideconquer.gcd.GCD

H

HamiltonianAll - Class in topics.backtracking.tsp: Exhaustive Search for Hamiltonian Cycles
HamiltonianAll(int, int, int[][]) - Constructor for class topics.backtracking.tsp.HamiltonianAll
HamiltonianAllTest - Class in topics.backtracking.tsp: Validation Suite for Exhaustive Hamiltonian Cycles
HamiltonianAllTest() - Constructor for class topics.backtracking.tsp.HamiltonianAllTest
Hardware Parallelism Inspection - Section in class topics.parallel.utils.ParallelismInfoTest
hasFoundSolution() - Method in class topics.backtracking.knighttour.ChessHorseOne: Retrieves the execution status to determine if a valid path was discovered.
hasFoundSolution() - Method in class topics.backtracking.nqueens.ChessQueensOne: Retrieves the execution status to determine if a valid arrangement was discovered.
hashCode() - Method in class topics.branchandbound.utils.Node
hashCode() - Method in record class topics.greedy.tsp.SalesmanSolution: Returns a hash code value for this object.
HashSet Demonstration - Section in class topics.foundation.structures.HashSetExample
HashSetExample - Class in topics.foundation.structures: HashSet Demonstration
HashSetExample() - Constructor for class topics.foundation.structures.HashSetExample
hasMajorityDivideAndConquer(int[]) - Method in class topics.divideconquer.majoritarian.MajoritarianElement: 3.
hasMajorityNaive(int[]) - Method in class topics.divideconquer.majoritarian.MajoritarianElement: 1.
hasMajoritySorting(int[]) - Method in class topics.divideconquer.majoritarian.MajoritarianElement: 2.
Heap - Class in topics.branchandbound.utils: To save and sort the nodes that are going to be used
Heap() - Constructor for class topics.branchandbound.utils.Heap: Constructor for Heap objects
Heapsort - Section in class topics.sorting.heapsort.Heapsort
Heapsort - Class in topics.sorting.heapsort: Heapsort
Heapsort() - Constructor for class topics.sorting.heapsort.Heapsort
HeapsortTest - Class in topics.sorting.heapsort: Validation Suite for Heapsort
HeapsortTest() - Constructor for class topics.sorting.heapsort.HeapsortTest
HeapThreads - Class in topics.branchandbound.utils.threads: Concurrent State Space Queue (Heap)
HeapThreads() - Constructor for class topics.branchandbound.utils.threads.HeapThreads: Initializes the concurrent collections required to manage the state space.
HelloWorld - Class in topics.foundation.helloworld: Hello World
HelloWorld() - Constructor for class topics.foundation.helloworld.HelloWorld
Hello World - Section in class topics.foundation.helloworld.HelloWorld
HelloWorldTest - Class in topics.foundation.helloworld: Tests for HelloWorld.
HelloWorldTest() - Constructor for class topics.foundation.helloworld.HelloWorldTest
HeuristicType - Enum Class in topics.branchandbound.eightpuzzle: Defines the available mathematical heuristics applied to evaluate proximity to the puzzle's final state.
heuristicValue - Variable in class topics.branchandbound.utils.Node: The calculated lower-bound metric evaluating the optimistic cost of this state.
HORIZONTAL - Enum constant in enum class topics.branchandbound.rectangles.PieceOrientation: Represents the default structural alignment.

I

1. Iterative Approach - Section in topics.divideconquer.vectorsum.VectorSum.sumIterative(int[])
1. Iterative Approach (Linear) - Section in topics.divideconquer.fibonacci.Fibonacci.fibonacciIterative(int)
1. Iterative Approach (Space Optimized DP) - Section in topics.dynamic.fibonacci.Fibonacci.fibonacciIterative(int)
id - Variable in class topics.branchandbound.utils.Node: The immutable unique identifier for this specific state configuration.
Important Note on Input Data - Section in class topics.dynamic.knapsack.Knapsack01
INF - Static variable in class topics.dynamic.floyd.FloydWarshall
initialValuePruneLimit() - Method in class topics.branchandbound.agents.AssignmentState: Establishes a preliminary upper bound to initiate the pruning phase.
initialValuePruneLimit() - Method in class topics.branchandbound.utils.Node: Establishes the preliminary upper-bound limit to trigger the initial pruning phase.
insert(Node) - Method in class topics.branchandbound.utils.Heap: Inserts a new node in the priority queue
insert(Node) - Method in class topics.branchandbound.utils.threads.HeapThreads: Safely inserts a new node into the priority queue if it has not been explored previously.
InterleavingNode - Class in topics.branchandbound.stringinterleaving: State Node for String Interleaving
InterleavingNode(String, String) - Constructor for class topics.branchandbound.stringinterleaving.InterleavingNode: Root Node Constructor.
InterleavingNode(InterleavingNode, String, int, int) - Constructor for class topics.branchandbound.stringinterleaving.InterleavingNode: Child Node Constructor.
isAssigned() - Method in class topics.greedy.rapiddefense.Defender
isEmpty() - Method in class topics.branchandbound.utils.threads.HeapThreads: Evaluates whether the active frontier contains any pending nodes.
isInterleaved(String, String, String) - Method in class topics.divideconquer.stringinterleaving.StringInterleaving: Public wrapper method to initialize the recursion safely.
isInterleaved(String, String, String) - Method in class topics.dynamic.stringinterleaving.StringInterleaving: Solves the interleaving problem using a bottom-up 2D tabulation.
isInterleaved(String, String, String) - Method in class topics.greedy.stringinterleaving.StringInterleaving: Attempts to verify interleaving using a purely greedy two-pointer strategy.
isSolution() - Method in class topics.branchandbound.agents.AssignmentState: Determines whether the current node represents a fully resolved combination.
isSolution() - Method in class topics.branchandbound.eightpuzzle.PuzzleState
isSolution() - Method in class topics.branchandbound.rectangles.BoardState: Determines whether the current node represents a fully resolved configuration.
isSolution() - Method in class topics.branchandbound.rectangles.Game: Determines whether the current node represents a fully resolved configuration.
isSolution() - Method in class topics.branchandbound.stringinterleaving.InterleavingNode
isSolution() - Method in class topics.branchandbound.utils.Node: Determines whether the current node represents a fully resolved configuration satisfying all problem constraints.

K

0/1 Knapsack - Section in class topics.dynamic.knapsack.Knapsack01
0/1 Knapsack - Section in class topics.greedy.knapsack.Knapsack01
knapsack01(int, float[], int[]) - Method in class topics.dynamic.knapsack.Knapsack01: Solves the 0/1 Knapsack problem using a 2D DP Matrix.
Knapsack01 - Class in topics.dynamic.knapsack: 0/1 Knapsack
Knapsack01 - Class in topics.greedy.knapsack: 0/1 Knapsack
Knapsack01() - Constructor for class topics.dynamic.knapsack.Knapsack01
Knapsack01() - Constructor for class topics.greedy.knapsack.Knapsack01
Knapsack01Test - Class in topics.dynamic.knapsack: Validation Suite for 0/1 Knapsack
Knapsack01Test - Class in topics.greedy.knapsack: Validation Suite for 0/1 Knapsack (Greedy Trap)
Knapsack01Test() - Constructor for class topics.dynamic.knapsack.Knapsack01Test
Knapsack01Test() - Constructor for class topics.greedy.knapsack.Knapsack01Test
Knight's Tour - Section in class topics.greedy.knighttour.ChessHorseSimpleHeuristic
Knight's Tour (Warnsdorff's Heuristic) - Section in class topics.greedy.knighttour.ChessHorse

L

5. Logarithmic Approach (D&C by Division) - Section in topics.divideconquer.fibonacci.Fibonacci.fibonacciLogarithmic(int)
5. Logarithmic Approach (Fast Doubling / Matrix Exponentiation) - Section in topics.dynamic.fibonacci.Fibonacci.fibonacciLogarithmic(int)
Legacy Stack Demonstration - Section in class topics.foundation.structures.StackExample
Legacy Thread-Safe Vector Demonstration - Section in class topics.foundation.structures.VectorExample
length - Variable in class topics.backtracking.paths.PathSimple
length - Variable in class topics.backtracking.tsp.HamiltonianAll
LinkedHashSet Demonstration - Section in class topics.foundation.structures.LinkedHashSetExample
LinkedHashSetExample - Class in topics.foundation.structures: LinkedHashSet Demonstration
LinkedHashSetExample() - Constructor for class topics.foundation.structures.LinkedHashSetExample
LinkedList Demonstration - Section in class topics.foundation.structures.LinkedListExample
LinkedListExample - Class in topics.foundation.structures: LinkedList Demonstration
LinkedListExample() - Constructor for class topics.foundation.structures.LinkedListExample
log - Static variable in class topics.backtracking.paths.PathSimple
log - Static variable in class topics.backtracking.tsp.HamiltonianAll
Lomuto Partition Scheme (with Mid-Pivot) - Section in topics.divideconquer.median.Util.partition(int[], int, int)
Longest Simple Path - Section in class topics.backtracking.paths.PathWorst

M

main(String[]) - Static method in class topics.backtracking.agents.AgentsTasksTimes
main(String[]) - Static method in class topics.backtracking.paths.PathBestTimes
main(String[]) - Static method in class topics.backtracking.permutations.PermutationsTimes
main(String[]) - Static method in class topics.backtracking.tsp.SalesmanTimes
main(String[]) - Static method in class topics.branchandbound.rectangles.RectanglesPlacementTestTime: Main execution entry point.
main(String[]) - Static method in class topics.branchandbound.rectangles.RectanglesPlacementTestTimeThreads: Main execution entry point.
main(String[]) - Static method in class topics.branchandbound.stringinterleaving.StringInterleavingBenchmark
main(String[]) - Static method in class topics.divideconquer.maxsum.MaxSumBenchmark
main(String[]) - Static method in class topics.dynamic.floyd.FloydWarshallTimes
main(String...) - Static method in class topics.foundation.maxpairwise.MaxPairWiseProductRandomNumbers: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.ArrayDequeExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.ArrayListExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.HashSetExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.LinkedHashSetExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.LinkedListExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.PriorityQueueExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.StackExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.TreeSetExample: Main execution entry point.
main(String[]) - Static method in class topics.foundation.structures.VectorExample: Main execution entry point.
main(String[]) - Static method in class topics.greedy.agents.AgentsTasksDifferentSizesTimes
main(String[]) - Static method in class topics.greedy.agents.AgentsTasksRandomValues
main(String[]) - Static method in class topics.greedy.rapiddefense.RapidDefenseBenchmark
MajoritarianElement - Class in topics.divideconquer.majoritarian: Majoritarian Element
MajoritarianElement() - Constructor for class topics.divideconquer.majoritarian.MajoritarianElement
Majoritarian Element - Section in class topics.divideconquer.majoritarian.MajoritarianElement
MajoritarianElementTest - Class in topics.divideconquer.majoritarian: Validation Suite for Majoritarian Element Algorithms
MajoritarianElementTest() - Constructor for class topics.divideconquer.majoritarian.MajoritarianElementTest
MANHATTAN - Enum constant in enum class topics.branchandbound.eightpuzzle.HeuristicType
mark - Variable in class topics.backtracking.paths.PathSimple
mark - Static variable in class topics.backtracking.permutations.PermutationsTimes
mark - Variable in class topics.backtracking.tsp.HamiltonianAll
max(int[]) - Method in class topics.foundation.maximum.GetMaximumFromList: Computes the maximum value within the provided sequence of integers.
maximizeFileCount(int[], int) - Method in class topics.greedy.disk.DiskPacking: Objective 1: Maximize Number of Files
maximizeSpaceUsage(int[], int) - Method in class topics.greedy.disk.DiskPacking: Objective 2: Maximize Space Usage (Minimize Free Space)
Maximum Pairwise Product - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct
Maximum Pairwise Product (64-bit Resolution) - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct2
Maximum Pairwise Product (Ascending Sort Strategy) - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct5
Maximum Pairwise Product (Brute-Force File Evaluation) - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct3
Maximum Pairwise Product (Optimal Linear Scan) - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct6
Maximum Pairwise Product (Sorting Strategy) - Section in class topics.foundation.maxpairwise.MaxPairWiseProduct4
Maximum Subarray Sum - Section in class topics.divideconquer.maxsum.MaxSum
Maximum Value Extraction - Section in class topics.foundation.maximum.GetMaximumFromList
MaxPairWiseProduct - Class in topics.foundation.maxpairwise: Maximum Pairwise Product
MaxPairWiseProduct() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProduct: Initializes the computational context with hardcoded large integers designed to trigger a 32-bit arithmetic overflow if not handled correctly.
MaxPairWiseProduct2 - Class in topics.foundation.maxpairwise: Maximum Pairwise Product (64-bit Resolution)
MaxPairWiseProduct2() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProduct2: Initializes the computational context with predefined large integers stored securely within 64-bit architectural bounds.
MaxPairWiseProduct3 - Class in topics.foundation.maxpairwise: Maximum Pairwise Product (Brute-Force File Evaluation)
MaxPairWiseProduct3() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProduct3: Initializes the computational context by reading a single-line dataset of space-separated integers from the filesystem into memory.
MaxPairWiseProduct4 - Class in topics.foundation.maxpairwise: Maximum Pairwise Product (Sorting Strategy)
MaxPairWiseProduct4() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProduct4: Initializes the computational context by reading a single-line dataset of space-separated integers from the filesystem into memory.
MaxPairWiseProduct5 - Class in topics.foundation.maxpairwise: Maximum Pairwise Product (Ascending Sort Strategy)
MaxPairWiseProduct5() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProduct5: Initializes the computational context by reading a single-line dataset of space-separated integers from the filesystem into memory.
MaxPairWiseProduct6 - Class in topics.foundation.maxpairwise: Maximum Pairwise Product (Optimal Linear Scan)
MaxPairWiseProduct6() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProduct6: Initializes the computational context by reading a single-line dataset of space-separated integers from the filesystem into memory.
MaxPairWiseProductRandomNumbers - Class in topics.foundation.maxpairwise: Random Dataset Generator
MaxPairWiseProductRandomNumbers() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductRandomNumbers
MaxPairWiseProductTest - Class in topics.foundation.maxpairwise: Validation Suite for Maximum Pairwise Product
MaxPairWiseProductTest() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductTest
MaxPairWiseProductTest2 - Class in topics.foundation.maxpairwise: Validation Suite for Maximum Pairwise Product (Native 64-bit)
MaxPairWiseProductTest2() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductTest2
MaxPairWiseProductTest3 - Class in topics.foundation.maxpairwise: Performance Validation Suite for Maximum Pairwise Product
MaxPairWiseProductTest3() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductTest3
MaxPairWiseProductTest4 - Class in topics.foundation.maxpairwise: Performance Validation Suite for Maximum Pairwise Product
MaxPairWiseProductTest4() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductTest4
MaxPairWiseProductTest5 - Class in topics.foundation.maxpairwise: Performance Validation Suite for Maximum Pairwise Product
MaxPairWiseProductTest5() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductTest5
MaxPairWiseProductTest6 - Class in topics.foundation.maxpairwise: Performance Validation Suite for Maximum Pairwise Product
MaxPairWiseProductTest6() - Constructor for class topics.foundation.maxpairwise.MaxPairWiseProductTest6
maxSubarrayCubic(int[]) - Method in class topics.divideconquer.maxsum.MaxSum: 1.
maxSubarrayDivideAndConquer(int[]) - Method in class topics.divideconquer.maxsum.MaxSum: 3.
maxSubarrayQuadratic(int[]) - Method in class topics.divideconquer.maxsum.MaxSum: 2.
MaxSum - Class in topics.divideconquer.maxsum: Maximum Subarray Sum
MaxSum() - Constructor for class topics.divideconquer.maxsum.MaxSum
MaxSumBenchmark - Class in topics.divideconquer.maxsum: Empirical Runtime Analysis for Maximum Subarray Sum
MaxSumBenchmark() - Constructor for class topics.divideconquer.maxsum.MaxSumBenchmark
MaxSumTest - Class in topics.divideconquer.maxsum: Validation Suite for Maximum Subarray Sum
MaxSumTest() - Constructor for class topics.divideconquer.maxsum.MaxSumTest
Median - Class in topics.divideconquer.median: Median Calculation
Median() - Constructor for class topics.divideconquer.median.Median
medianBySorting(int[]) - Method in class topics.divideconquer.median.Median: 1.
Median Calculation - Section in class topics.divideconquer.median.Median
medianQuickselect(int[]) - Method in class topics.divideconquer.median.Median: 2.
MedianTest - Class in topics.divideconquer.median: Validation Suite for Median Calculation
MedianTest() - Constructor for class topics.divideconquer.median.MedianTest
Mergesort - Section in class topics.sorting.mergesort.Mergesort
Mergesort - Class in topics.sorting.mergesort: Mergesort
Mergesort() - Constructor for class topics.sorting.mergesort.Mergesort
MergesortTest - Class in topics.sorting.mergesort: Validation Suite for Mergesort
MergesortTest() - Constructor for class topics.sorting.mergesort.MergesortTest
Mode - Class in topics.divideconquer.mode: Mode Calculation
Mode() - Constructor for class topics.divideconquer.mode.Mode
Mode Calculation - Section in class topics.divideconquer.mode.Mode
ModeTest - Class in topics.divideconquer.mode: Validation Suite for Mode Algorithms
ModeTest() - Constructor for class topics.divideconquer.mode.ModeTest
MultiPlumber - Class in topics.greedy.plumber: Multi-Plumber Scheduling
MultiPlumber() - Constructor for class topics.greedy.plumber.MultiPlumber
Multi-Plumber Scheduling - Section in class topics.greedy.plumber.MultiPlumber
MultiPlumberTest - Class in topics.greedy.plumber: Validation Suite for Multi-Plumber Scheduling
MultiPlumberTest() - Constructor for class topics.greedy.plumber.MultiPlumberTest

N

1. Naive Cubic Approach O(N³) - Section in topics.divideconquer.maxsum.MaxSum.maxSubarrayCubic(int[])
1. Naive Greedy Assignment O(N²) - Section in topics.greedy.rapiddefense.RapidDefense.assignBasic(List, List)
1. Naive Iterative Approach - Section in topics.divideconquer.majoritarian.MajoritarianElement.hasMajorityNaive(int[])
1. Naive Iterative Approach - Section in topics.divideconquer.mode.Mode.calculateModeNaive(int[])
4. Naive Recursive (The Overlapping Trap) - Section in topics.divideconquer.fibonacci.Fibonacci.fibonacciNaiveRecursive(int)
4. Naive Recursive Approach (The Trap) - Section in topics.dynamic.fibonacci.Fibonacci.fibonacciNaiveRecursive(int)
n - Variable in class topics.backtracking.paths.PathSimple
n - Static variable in class topics.backtracking.permutations.PermutationsTimes
n - Variable in class topics.backtracking.tsp.HamiltonianAll
Naive Algorithm - Section in topics.divideconquer.gcd.GCD.naiveGCD(long, long)
naiveGCD(long, long) - Method in class topics.divideconquer.gcd.GCD: Naive Algorithm
Naive Recursive Fibonacci - Section in class topics.parallel.fibonacci.FibonacciAlgorithm
Node - Class in topics.branchandbound.utils: State Space Tree Node
Node() - Constructor for class topics.branchandbound.utils.Node: Initializes the foundational properties of a new state node, generating its unique identity and establishing it as an unlinked topological root by default.
nodeHeap - Variable in class topics.branchandbound.utils.BranchAndBound: The priority queue managing the active, unexplored nodes in the state space tree.
nodeHeap - Static variable in class topics.branchandbound.utils.threads.BranchAndBoundThreads: The concurrent priority queue managing the active, unexplored nodes in the state space tree.
nodes - Variable in class topics.backtracking.paths.PathSimple
nodes - Variable in class topics.branchandbound.utils.Heap
nsol - Variable in class topics.backtracking.paths.PathSimple
nsol - Variable in class topics.backtracking.tsp.HamiltonianAll

O

2. Optimized Greedy Assignment O(N log N) - Section in topics.greedy.rapiddefense.RapidDefense.assignQuick(List, List)
2. Optimized Quadratic Approach O(N²) - Section in topics.divideconquer.maxsum.MaxSum.maxSubarrayQuadratic(int[])
Objective 1: Maximize Number of Files - Section in topics.greedy.disk.DiskPacking.maximizeFileCount(int[], int)
Objective 2: Maximize Space Usage (Minimize Free Space) - Section in topics.greedy.disk.DiskPacking.maximizeSpaceUsage(int[], int)
Optimal Placement of Rectangles - Section in class topics.branchandbound.rectangles.RectanglesPlacement
Optimal Placement of Rectangles (Concurrent Execution) - Section in class topics.branchandbound.rectangles.RectanglesPlacementThreads

P

Parallel Array Squaring (Fork/Join) - Section in class topics.parallel.square.RecursiveActionSquare
Parallel Array Summation (Fork/Join) - Section in class topics.parallel.sum.RecursiveTaskSum
Parallel Array Transformation (Fork/Join) - Section in class topics.parallel.cuberoot.RecursiveActionComparison
Parallel Fibonacci (Fork/Join) - Section in class topics.parallel.fibonacci.FibonacciTask
Parallel File Processing (Fork/Join) - Section in class topics.parallel.fileprocessing.FileProcessingTask
ParallelismInfoTest - Class in topics.parallel.utils: Hardware Parallelism Inspection
ParallelismInfoTest() - Constructor for class topics.parallel.utils.ParallelismInfoTest
parentId - Variable in class topics.branchandbound.utils.Node: The unique identifier of the preceding node from which this state was derived, allowing the extraction of the final path lineage.
partition(int[], int, int) - Static method in class topics.divideconquer.median.Util: Lomuto Partition Scheme (with Mid-Pivot)
path - Variable in class topics.backtracking.paths.PathSimple
path - Variable in class topics.backtracking.tsp.HamiltonianAll
path() - Method in record class topics.greedy.tsp.SalesmanSolution: Returns the value of the path record component.
PathAll - Class in topics.backtracking.paths: Paths with an Exact Threshold Cost
PathAll(int, int) - Constructor for class topics.backtracking.paths.PathAll
PathAllTest - Class in topics.backtracking.paths
PathAllTest() - Constructor for class topics.backtracking.paths.PathAllTest
PathBest - Class in topics.backtracking.paths: Shortest Simple Path (Un-pruned)
PathBest(int) - Constructor for class topics.backtracking.paths.PathBest
PathBestPruning - Class in topics.backtracking.paths: Shortest Simple Path (Branch invalid input: '&' Bound)
PathBestPruning(int) - Constructor for class topics.backtracking.paths.PathBestPruning
PathBestPruningTest - Class in topics.backtracking.paths: Validation Suite for Shortest Path (Branch invalid input: '&' Bound)
PathBestPruningTest() - Constructor for class topics.backtracking.paths.PathBestPruningTest
PathBestTest - Class in topics.backtracking.paths: Validation Suite for Shortest Path (Un-pruned)
PathBestTest() - Constructor for class topics.backtracking.paths.PathBestTest
PathBestTimes - Class in topics.backtracking.paths: Empirical Analysis: Pruning Impact
PathBestTimes() - Constructor for class topics.backtracking.paths.PathBestTimes
PathSimple - Class in topics.backtracking.paths: Simple Paths in a Graph
PathSimple(int) - Constructor for class topics.backtracking.paths.PathSimple
PathSimpleTest - Class in topics.backtracking.paths
PathSimpleTest() - Constructor for class topics.backtracking.paths.PathSimpleTest
Paths with an Exact Threshold Cost - Section in class topics.backtracking.paths.PathAll
PathWorst - Class in topics.backtracking.paths: Longest Simple Path
PathWorst(int) - Constructor for class topics.backtracking.paths.PathWorst
PathWorstTest - Class in topics.backtracking.paths
PathWorstTest() - Constructor for class topics.backtracking.paths.PathWorstTest
Pedagogical Note - Section in class topics.backtracking.paths.PathAll
Pedagogical Note - Section in class topics.backtracking.paths.PathBest
Pedagogical Note - Section in class topics.backtracking.paths.PathWorst
Pedagogical Note: TSP vs Cycles - Section in class topics.backtracking.tsp.CyclesAll
Pedagogical Note on Complexity - Section in class topics.backtracking.tsp.SalesmanTimes
Pedagogical Value - Section in class topics.divideconquer.stringinterleaving.StringInterleaving
Performance Validation Suite for Maximum Pairwise Product - Section in class topics.foundation.maxpairwise.MaxPairWiseProductTest3
Performance Validation Suite for Maximum Pairwise Product - Section in class topics.foundation.maxpairwise.MaxPairWiseProductTest4
Performance Validation Suite for Maximum Pairwise Product - Section in class topics.foundation.maxpairwise.MaxPairWiseProductTest5
Performance Validation Suite for Maximum Pairwise Product - Section in class topics.foundation.maxpairwise.MaxPairWiseProductTest6
Permutations - Class in topics.backtracking.permutations: Permutations Generation
Permutations(int) - Constructor for class topics.backtracking.permutations.Permutations: Initializes the state tracking structures to generate permutations for a set of integers from 0 to N-1.
Permutations Generation - Section in class topics.backtracking.permutations.Permutations
PermutationsTest - Class in topics.backtracking.permutations: Test Suite for Permutations Generator
PermutationsTest() - Constructor for class topics.backtracking.permutations.PermutationsTest
PermutationsTimes - Class in topics.backtracking.permutations: BACKTRACKING PROBLEM: PERMUTATIONS OF N ELEMENTS This program calculates times to generate the permutations of n elements.
PermutationsTimes() - Constructor for class topics.backtracking.permutations.PermutationsTimes
Phases of the Benchmark: - Section in class topics.branchandbound.stringinterleaving.StringInterleavingBenchmark
Piece - Class in topics.branchandbound.rectangles: Rectangular Piece
Piece(int, int) - Constructor for class topics.branchandbound.rectangles.Piece: Constructs a new rectangular piece with the specified dimensions.
PieceOrientation - Enum Class in topics.branchandbound.rectangles: Piece Orientation
Piece Orientation - Section in enum class topics.branchandbound.rectangles.PieceOrientation
Plumber - Class in topics.greedy.plumber: Single-Plumber Scheduling
Plumber(int[]) - Constructor for class topics.greedy.plumber.Plumber: Builds a plumber instance with task durations.
PlumberTest - Class in topics.greedy.plumber: Validation Suite for Single-Plumber Scheduling
PlumberTest() - Constructor for class topics.greedy.plumber.PlumberTest
printSolutionTrace() - Method in class topics.branchandbound.utils.BranchAndBound: Extracts and logs the complete topological lineage of the optimal path, detailing every state transition from the root node to the final solution leaf.
printSolutionTrace() - Method in class topics.branchandbound.utils.threads.BranchAndBoundThreads: Extracts and logs the complete topological lineage of the optimal path, detailing every state transition from the root node to the final solution leaf.
PriorityQueue Demonstration - Section in class topics.foundation.structures.PriorityQueueExample
PriorityQueueExample - Class in topics.foundation.structures: PriorityQueue Demonstration
PriorityQueueExample() - Constructor for class topics.foundation.structures.PriorityQueueExample
PuzzleState - Class in topics.branchandbound.eightpuzzle: Represents a distinct physical configuration of the board within the execution tree.
PuzzleState(int[], HeuristicType, int, UUID) - Constructor for class topics.branchandbound.eightpuzzle.PuzzleState: Constructs a child node representing a subsequent move.
PuzzleState(HeuristicType, int[]) - Constructor for class topics.branchandbound.eightpuzzle.PuzzleState: Constructs the root node of the state space tree.

Q

2. Quickselect Approach (Divide & Conquer) - Section in topics.divideconquer.median.Median.medianQuickselect(int[])
Quicksort - Class in topics.sorting.quicksort: Quicksort (Median-of-Three)
Quicksort() - Constructor for class topics.sorting.quicksort.Quicksort
Quicksort (Median-of-Three) - Section in class topics.sorting.quicksort.Quicksort
QuicksortTest - Class in topics.sorting.quicksort: Validation Suite for Quicksort
QuicksortTest() - Constructor for class topics.sorting.quicksort.QuicksortTest

R

Radix - Class in topics.sorting.radix: Radix Sort (LSD - Least Significant Digit)
Radix() - Constructor for class topics.sorting.radix.Radix
Radix Sort (LSD - Least Significant Digit) - Section in class topics.sorting.radix.Radix
RadixTest - Class in topics.sorting.radix: Validation Suite for Radix Sort
RadixTest() - Constructor for class topics.sorting.radix.RadixTest
Random Asset Generator for Agent Task Assignment - Section in class topics.greedy.agents.AgentsTasksRandomValues
Random Dataset Generator - Section in class topics.foundation.maxpairwise.MaxPairWiseProductRandomNumbers
RapidDefense - Class in topics.greedy.rapiddefense: Rapid Defense Assignment
RapidDefense() - Constructor for class topics.greedy.rapiddefense.RapidDefense
Rapid Defense Assignment - Section in class topics.greedy.rapiddefense.RapidDefense
RapidDefenseBenchmark - Class in topics.greedy.rapiddefense: Empirical Runtime Analysis
RapidDefenseBenchmark() - Constructor for class topics.greedy.rapiddefense.RapidDefenseBenchmark
RapidDefenseTest - Class in topics.greedy.rapiddefense
RapidDefenseTest() - Constructor for class topics.greedy.rapiddefense.RapidDefenseTest
reconstructPath(int[][], int, int, String[]) - Method in class topics.dynamic.floyd.FloydWarshall: Recursively reconstructs the shortest path between two nodes.
RectanglesPlacement - Class in topics.branchandbound.rectangles: Optimal Placement of Rectangles
RectanglesPlacement(int, List) - Constructor for class topics.branchandbound.rectangles.RectanglesPlacement: Initializes the problem solver and establishes the execution tree root.
RectanglesPlacementTest - Class in topics.branchandbound.rectangles: Test Suite for Optimal Rectangles Placement
RectanglesPlacementTest() - Constructor for class topics.branchandbound.rectangles.RectanglesPlacementTest
RectanglesPlacementTestTime - Class in topics.branchandbound.rectangles: Sequential Performance Benchmark (Rectangle Placement)
RectanglesPlacementTestTime() - Constructor for class topics.branchandbound.rectangles.RectanglesPlacementTestTime: Initializes the benchmark environment, defining the board dimensions and the specific set of rectangular pieces to be processed.
RectanglesPlacementTestTimeThreads - Class in topics.branchandbound.rectangles: Concurrent Performance Benchmark (Rectangle Placement)
RectanglesPlacementTestTimeThreads() - Constructor for class topics.branchandbound.rectangles.RectanglesPlacementTestTimeThreads: Initializes the concurrent benchmark environment, defining the board dimensions and the specific set of rectangular pieces to be processed.
RectanglesPlacementThreads - Class in topics.branchandbound.rectangles: Optimal Placement of Rectangles (Concurrent Execution)
RectanglesPlacementThreads(int, List) - Constructor for class topics.branchandbound.rectangles.RectanglesPlacementThreads: Initializes the concurrent problem solver and establishes the execution tree root.
Rectangular Piece - Section in class topics.branchandbound.rectangles.Piece
RecursiveActionComparison - Class in topics.parallel.cuberoot: Parallel Array Transformation (Fork/Join)
RecursiveActionComparison(int[], int, int, int) - Constructor for class topics.parallel.cuberoot.RecursiveActionComparison: Initializes the parallel action for a specific segment of the array.
RecursiveActionComparisonTest - Class in topics.parallel.cuberoot: Validation Suite for Parallel Array Transformation
RecursiveActionComparisonTest() - Constructor for class topics.parallel.cuberoot.RecursiveActionComparisonTest
RecursiveActionSquare - Class in topics.parallel.square: Parallel Array Squaring (Fork/Join)
RecursiveActionSquare(int[], int, int) - Constructor for class topics.parallel.square.RecursiveActionSquare: Initializes the parallel action for a targeted segment of the array.
RecursiveActionSquareTest - Class in topics.parallel.square: Validation Suite for Parallel Squaring
RecursiveActionSquareTest() - Constructor for class topics.parallel.square.RecursiveActionSquareTest
RecursiveTaskSum - Class in topics.parallel.sum: Parallel Array Summation (Fork/Join)
RecursiveTaskSum(double[], int, int) - Constructor for class topics.parallel.sum.RecursiveTaskSum: Initializes a sum task for a dedicated boundary segment of the array.
RecursiveTaskSumTest - Class in topics.parallel.sum: Validation Suite for Parallel Summation
RecursiveTaskSumTest() - Constructor for class topics.parallel.sum.RecursiveTaskSumTest
Relaxation Process - Section in class topics.dynamic.floyd.FloydWarshall
RiverTravel - Class in topics.dynamic.river: Cheaper Travel on the River
RiverTravel() - Constructor for class topics.dynamic.river.RiverTravel
RiverTravelTest - Class in topics.dynamic.river: Validation Suite for River Travel (DP)
RiverTravelTest() - Constructor for class topics.dynamic.river.RiverTravelTest
rootNode - Variable in class topics.branchandbound.utils.BranchAndBound: The origin state of the problem.
rootNode - Static variable in class topics.branchandbound.utils.threads.BranchAndBoundThreads: The origin state of the problem environment.
run() - Method in class topics.branchandbound.utils.threads.WorkerThread: Executes the continuous extraction and evaluation loop until the shared state space tree is exhausted or completely pruned.

S

1. Sorting Approach - Section in topics.divideconquer.median.Median.medianBySorting(int[])
2. Sorting Approach - Section in topics.divideconquer.majoritarian.MajoritarianElement.hasMajoritySorting(int[])
2. Sorting Approach (Divide & Conquer) - Section in topics.divideconquer.mode.Mode.calculateModeSorting(int[])
Salesman - Class in topics.backtracking.tsp: Traveling Salesman
Salesman(int, int, int[][]) - Constructor for class topics.backtracking.tsp.Salesman
SalesmanPruning - Class in topics.backtracking.tsp: TSP Optimization with Pruning (Bounding)
SalesmanPruning(int, int, int[][]) - Constructor for class topics.backtracking.tsp.SalesmanPruning
SalesmanPruningTest - Class in topics.backtracking.tsp: Validation Suite for Pruned TSP
SalesmanPruningTest() - Constructor for class topics.backtracking.tsp.SalesmanPruningTest
SalesmanSolution - Record Class in topics.greedy.tsp: Record class to hold the calculated path and its cost.
SalesmanSolution(int[], int) - Constructor for record class topics.greedy.tsp.SalesmanSolution: Creates an instance of a SalesmanSolution record class.
SalesmanTest - Class in topics.backtracking.tsp
SalesmanTest() - Constructor for class topics.backtracking.tsp.SalesmanTest
SalesmanTimes - Class in topics.backtracking.tsp: Empirical Complexity Analysis: TSP Optimizations
SalesmanTimes() - Constructor for class topics.backtracking.tsp.SalesmanTimes
Search - Class in topics.foundation.search: Search (Algorithmic Structural Variations)
Search() - Constructor for class topics.foundation.search.Search
Search (Algorithmic Structural Variations) - Section in class topics.foundation.search.Search
searchBinary(int[], int) - Method in class topics.foundation.search.Search: Performs a binary search across a strictly sorted array.
searchIterative(int[], int) - Method in class topics.divideconquer.search.SequentialSearch: Iterative implementation of sequential linear search.
searchRecursive(int[], int) - Method in class topics.divideconquer.search.SequentialSearch: Recursive implementation of sequential linear search.
searchSequential(int[], int) - Method in class topics.foundation.search.Search: Performs a standard sequential (linear) search across an array.
searchSequentialSentinel(List, int) - Method in class topics.foundation.search.Search: Performs a sequential search utilizing a "sentinel" value.
SearchTest - Class in topics.foundation.search: Validation Suite for Search Algorithms
SearchTest() - Constructor for class topics.foundation.search.SearchTest
Sequential (Linear) Search - Section in class topics.divideconquer.search.SequentialSearch
Sequential Performance Benchmark (Rectangle Placement) - Section in class topics.branchandbound.rectangles.RectanglesPlacementTestTime
SequentialSearch - Class in topics.divideconquer.search: Sequential (Linear) Search
SequentialSearch() - Constructor for class topics.divideconquer.search.SequentialSearch
SequentialSearchTest - Class in topics.divideconquer.search: Validation Suite for Sequential Search
SequentialSearchTest() - Constructor for class topics.divideconquer.search.SequentialSearchTest
setAssigned(boolean) - Method in class topics.greedy.rapiddefense.Defender
setDefenderTeamId(int) - Method in class topics.greedy.rapiddefense.City
setSource(int) - Method in class topics.backtracking.paths.PathAll
setSource(int) - Method in class topics.backtracking.paths.PathSimple
setTarget(int) - Method in class topics.backtracking.paths.PathSimple
setup() - Static method in class topics.backtracking.agents.AgentsTasksTest
setup() - Static method in class topics.backtracking.knighttour.ChessHorseAllTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.backtracking.knighttour.ChessHorseOneTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.backtracking.nqueens.ChessQueensAllTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.backtracking.nqueens.ChessQueensOneTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.backtracking.permutations.PermutationsTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.backtracking.stringinterleaving.StringInterleavingGeneratorTest
setup() - Static method in class topics.backtracking.subsetsum.SubsetsGivenSumTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.branchandbound.agents.AgentsTasksTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.branchandbound.eightpuzzle.EightPuzzleTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Initializes context and resources prior to executing the test suite.
setup() - Static method in class topics.divideconquer.factorial.FactorialTest
setup() - Static method in class topics.divideconquer.fibonacci.FibonacciTest
setup() - Static method in class topics.divideconquer.gcd.GCDTest
setup() - Static method in class topics.divideconquer.majoritarian.MajoritarianElementTest
setup() - Static method in class topics.divideconquer.maxsum.MaxSumTest
setup() - Static method in class topics.divideconquer.median.MedianTest
setup() - Static method in class topics.divideconquer.mode.ModeTest
setup() - Static method in class topics.divideconquer.search.BinarySearchTest
setup() - Static method in class topics.divideconquer.search.SequentialSearchTest
setup() - Static method in class topics.divideconquer.stringinterleaving.StringInterleavingTest
setup() - Static method in class topics.divideconquer.vectorsum.VectorSumTest
setup() - Static method in class topics.dynamic.change.ChangeTest
setup() - Static method in class topics.dynamic.combinations.CombinationsTest
setup() - Static method in class topics.dynamic.fibonacci.FibonacciTest
setup() - Static method in class topics.dynamic.knapsack.Knapsack01Test
setup() - Static method in class topics.dynamic.river.RiverTravelTest
setup() - Static method in class topics.dynamic.stringinterleaving.StringInterleavingTest
setup() - Method in class topics.foundation.factorial.FactorialTest: Initializes the context and instantiates the computational engine prior to executing mathematical validations.
setup() - Static method in class topics.foundation.helloworld.HelloWorldTest
setup() - Static method in class topics.foundation.maximum.GetMaximumFromListTest: Initializes context and instantiates the computational engine prior to executing the validations.
setup() - Static method in class topics.foundation.search.SearchTest: Initializes the context and instantiates the computational engine prior to executing the validations.
setup() - Static method in class topics.foundation.sum.GetAdditionFromListTest: Initializes context and instantiates the computational engine prior to executing the validations.
setup() - Static method in class topics.greedy.agents.AgentsTasksTest
setup() - Static method in class topics.greedy.change.ChangeTest
setup() - Static method in class topics.greedy.disk.DiskPackingTest
setup() - Static method in class topics.greedy.knapsack.FractionalKnapsackTest
setup() - Static method in class topics.greedy.knapsack.Knapsack01Test
setup() - Static method in class topics.greedy.knighttour.ChessHorseSimpleHeuristicTest
setup() - Static method in class topics.greedy.knighttour.ChessHorseTest
setup() - Static method in class topics.greedy.plumber.MultiPlumberTest
setup() - Static method in class topics.greedy.plumber.PlumberTest
setup() - Method in class topics.greedy.rapiddefense.RapidDefenseTest
setup() - Static method in class topics.greedy.stringinterleaving.StringInterleavingTest
setup() - Static method in class topics.parallel.cuberoot.RecursiveActionComparisonTest: Initializes the massive dataset once to avoid penalizing individual tests with random number generation overhead.
setup() - Static method in class topics.parallel.fibonacci.FibonacciAlgorithmTest: Initializes the context prior to executing validations.
setup() - Static method in class topics.parallel.fibonacci.FibonacciTaskTest: Initializes the testing context and provisions the concurrent thread pool.
setup() - Static method in class topics.parallel.fileprocessing.FileProcessingTaskTest
setup() - Static method in class topics.parallel.square.RecursiveActionSquareTest: Provisions resources and generates raw mock sequences prior to evaluation.
setup() - Static method in class topics.parallel.sum.RecursiveTaskSumTest: Provisions concurrent resources and structures an alternate dataset of 999,999 values prior to executing benchmarks.
setup() - Static method in class topics.sorting.bubble.BidirectionalBubbleTest
setup() - Static method in class topics.sorting.bubble.BubbleSentinelTest
setup() - Static method in class topics.sorting.bubble.BubbleTest
setup() - Static method in class topics.sorting.heapsort.HeapsortTest
setup() - Static method in class topics.sorting.insertion.BinaryInsertionTest
setup() - Static method in class topics.sorting.insertion.DirectInsertionTest
setup() - Static method in class topics.sorting.mergesort.MergesortTest
setup() - Static method in class topics.sorting.quicksort.QuicksortTest
setup() - Static method in class topics.sorting.radix.RadixTest
setup() - Static method in class topics.sorting.selection.DirectSelectionTest
setup() - Static method in class topics.sorting.shellsort.ShellsortTest
setWeightMatrix(int[][]) - Method in class topics.backtracking.paths.PathSimple
Shellsort - Section in class topics.sorting.shellsort.Shellsort
Shellsort - Class in topics.sorting.shellsort: Shellsort
Shellsort() - Constructor for class topics.sorting.shellsort.Shellsort
ShellsortTest - Class in topics.sorting.shellsort: Validation Suite for Shellsort
ShellsortTest() - Constructor for class topics.sorting.shellsort.ShellsortTest
Shortest Simple Path (Branch & Bound) - Section in class topics.backtracking.paths.PathBestPruning
Shortest Simple Path (Un-pruned) - Section in class topics.backtracking.paths.PathBest
shouldAccuratelyComputeLargeProductNatively() - Method in class topics.foundation.maxpairwise.MaxPairWiseProductTest2: Scenario: Computing the product of 100,000 and 1,000,000 using native long types.
shouldAccuratelyComputeLargeProductWithoutOverflow() - Method in class topics.foundation.maxpairwise.MaxPairWiseProductTest: Scenario: Computing the product of 100,000 and 1,000,000.
shouldAccuratelyExtractMaximumElement() - Method in class topics.foundation.maximum.GetMaximumFromListTest: Scenario: Extracting the maximum from an array containing assorted integers.
shouldAccuratelySumArrayElements() - Method in class topics.foundation.sum.GetAdditionFromListTest: Scenario: Calculating the sum of an array containing positive and negative integers.
shouldAggregateArraySumInParallelCorrectly() - Method in class topics.parallel.sum.RecursiveTaskSumTest: Scenario: Accumulating 999,999 alternated float primitives in parallel.
shouldAssignAgentsToTasksUsingColumnMinima() - Method in class topics.greedy.agents.AgentsTasksTest
shouldAssignTasksToAgentsUsingRowMinima() - Method in class topics.greedy.agents.AgentsTasksTest
shouldCalculateArrayBased() - Method in class topics.divideconquer.fibonacci.FibonacciTest
shouldCalculateEuclideanGCDMaxBounds() - Method in class topics.divideconquer.gcd.GCDTest
shouldCalculateEuclideanGCDSmall() - Method in class topics.divideconquer.gcd.GCDTest
shouldCalculateEuclideanGCDStandard() - Method in class topics.divideconquer.gcd.GCDTest
shouldCalculateIterative() - Method in class topics.divideconquer.fibonacci.FibonacciTest
shouldCalculateIterativeFactorial() - Method in class topics.divideconquer.factorial.FactorialTest
shouldCalculateLargeScaleCombinations() - Method in class topics.dynamic.combinations.CombinationsTest
shouldCalculateLogarithmic() - Method in class topics.divideconquer.fibonacci.FibonacciTest
shouldCalculateMinCostWithNegativeEdges() - Method in class topics.dynamic.floyd.FloydWarshallTest
shouldCalculateModeNaive() - Method in class topics.divideconquer.mode.ModeTest
shouldCalculateModeSorting() - Method in class topics.divideconquer.mode.ModeTest
shouldCalculateNaiveGCDMaxBounds() - Method in class topics.divideconquer.gcd.GCDTest
shouldCalculateNaiveGCDStandard() - Method in class topics.divideconquer.gcd.GCDTest
shouldCalculateNaiveRecursive() - Method in class topics.divideconquer.fibonacci.FibonacciTest
shouldCalculateOptimalRoundRobinAssignment() - Method in class topics.greedy.plumber.MultiPlumberTest
shouldCalculateOptimalRoutesCase1() - Method in class topics.dynamic.river.RiverTravelTest
shouldCalculateOptimalRoutesCase2() - Method in class topics.dynamic.river.RiverTravelTest
shouldCalculateOptimalWaitingTimeDirectly() - Method in class topics.greedy.plumber.PlumberTest
shouldCalculateRecursiveFactorial() - Method in class topics.divideconquer.factorial.FactorialTest
shouldCalculateSmallScaleCombinations() - Method in class topics.dynamic.combinations.CombinationsTest
shouldCalculateStandardDeckCombinations() - Method in class topics.dynamic.combinations.CombinationsTest
shouldCalculateSubOptimalRandomAssignment() - Method in class topics.greedy.plumber.MultiPlumberTest
shouldCalculateTailRecursive() - Method in class topics.divideconquer.fibonacci.FibonacciTest
shouldCalculateWaitingTimeBiggestFirst() - Method in class topics.greedy.plumber.PlumberTest
shouldCalculateWaitingTimeRandomOrder() - Method in class topics.greedy.plumber.PlumberTest
shouldCalculateWaitingTimeSmallestFirst() - Method in class topics.greedy.plumber.PlumberTest
shouldCompleteFullChessboard() - Method in class topics.greedy.knighttour.ChessHorseTest
shouldComputeFibonacciForLargeSizeAndDemonstrateBottleneck() - Method in class topics.parallel.fibonacci.FibonacciAlgorithmTest: Scenario: Computes Fibonacci for N=50.
shouldComputeFibonacciForLargeSizeInParallel() - Method in class topics.parallel.fibonacci.FibonacciTaskTest: Scenario: Parallel execution for N=50.
shouldComputeFibonacciForModerateSize() - Method in class topics.parallel.fibonacci.FibonacciAlgorithmTest: Scenario: Computes Fibonacci for N=30.
shouldComputeFibonacciForModerateSizeInParallel() - Method in class topics.parallel.fibonacci.FibonacciTaskTest: Scenario: Parallel execution for N=30.
shouldComputePositiveFactorials() - Method in class topics.foundation.factorial.FactorialTest: Scenario: Invoking the safe computation with a valid positive integer (4).
shouldComputeProductAndBenchmarkDuration() - Method in class topics.foundation.maxpairwise.MaxPairWiseProductTest3: Scenario: Computing the maximum pairwise product from a file-loaded dataset.
shouldComputeProductAndBenchmarkResources() - Method in class topics.foundation.maxpairwise.MaxPairWiseProductTest4: Scenario: Computing the maximum pairwise product using a descending sort.
shouldComputeProductAndBenchmarkResources() - Method in class topics.foundation.maxpairwise.MaxPairWiseProductTest5: Scenario: Computing the maximum pairwise product using an ascending sort.
shouldComputeProductAndBenchmarkResources() - Method in class topics.foundation.maxpairwise.MaxPairWiseProductTest6: Scenario: Computing the maximum pairwise product using a single linear scan.
shouldComputeSquaresInParallelCorrectly() - Method in class topics.parallel.square.RecursiveActionSquareTest: Scenario: Processing an array of 1,000 integers through Fork/Join decomposition.
shouldDemonstrateGreedyTrap() - Method in class topics.greedy.stringinterleaving.StringInterleavingTest
shouldDemonstrateGreedyTrap1() - Method in class topics.greedy.knapsack.Knapsack01Test
shouldDemonstrateGreedyTrap2() - Method in class topics.greedy.knapsack.Knapsack01Test
shouldDemonstrateRecursiveLagOnModerateDatasets() - Method in class topics.dynamic.combinations.CombinationsTest
shouldDemonstrateSpaceUsageGreedyTrap() - Method in class topics.greedy.disk.DiskPackingTest
shouldDemonstrateSubOptimalGreedyBehavior1() - Method in class topics.greedy.change.ChangeTest
shouldDemonstrateSubOptimalGreedyBehavior2() - Method in class topics.greedy.change.ChangeTest
shouldExecuteWithCoarseGranularity() - Method in class topics.parallel.cuberoot.RecursiveActionComparisonTest: Scenario: Single Thread (1) with coarse granularity (10,000 elements).
shouldExecuteWithFineGranularity() - Method in class topics.parallel.cuberoot.RecursiveActionComparisonTest: Scenario: Low Parallelism (3 threads) with extremely fine granularity (100 elements).
shouldExecuteWithModerateGranularity() - Method in class topics.parallel.cuberoot.RecursiveActionComparisonTest: Scenario: High Parallelism (8 threads) with moderate granularity (1,000 elements).
shouldFailOnSmallBoard() - Method in class topics.greedy.knighttour.ChessHorseSimpleHeuristicTest
shouldFailOnSpecificBoardAndStart() - Method in class topics.greedy.knighttour.ChessHorseTest
shouldFindAllPermutationsWithoutPruning() - Method in class topics.branchandbound.stringinterleaving.StringInterleavingBBTest
shouldFindAllSolutionsOnStandard5x5Board() - Method in class topics.backtracking.knighttour.ChessHorseAllTest: Scenario: Standard 5x5 board starting at the top-left corner.
shouldFindElementIteratively() - Method in class topics.divideconquer.search.BinarySearchTest
shouldFindElementIteratively() - Method in class topics.divideconquer.search.SequentialSearchTest
shouldFindElementRecursively() - Method in class topics.divideconquer.search.BinarySearchTest
shouldFindElementRecursively() - Method in class topics.divideconquer.search.SequentialSearchTest
shouldFindElementUsingBinarySearch() - Method in class topics.foundation.search.SearchTest: Scenario: Binary search across a sorted dataset for an existing element.
shouldFindElementUsingSentinelSearch() - Method in class topics.foundation.search.SearchTest: Scenario: Sentinel-backed sequential search for an existing element.
shouldFindElementUsingSequentialSearch() - Method in class topics.foundation.search.SearchTest: Scenario: Standard sequential search for an existing element.
shouldFindGlobalOptimum() - Method in class topics.backtracking.agents.AgentsTasksTest
shouldFindGreedyCycleOnSevenNodeGraph() - Method in class topics.greedy.tsp.TravelingSalesmanTest
shouldFindMajorityDivideAndConquer() - Method in class topics.divideconquer.majoritarian.MajoritarianElementTest
shouldFindMajorityIterative() - Method in class topics.divideconquer.majoritarian.MajoritarianElementTest
shouldFindMajoritySorting() - Method in class topics.divideconquer.majoritarian.MajoritarianElementTest
shouldFindMaxSumCubic() - Method in class topics.divideconquer.maxsum.MaxSumTest
shouldFindMaxSumDivideAndConquer() - Method in class topics.divideconquer.maxsum.MaxSumTest
shouldFindMaxSumQuadratic() - Method in class topics.divideconquer.maxsum.MaxSumTest
shouldFindMedianEvenQuickselect() - Method in class topics.divideconquer.median.MedianTest
shouldFindMedianEvenSorting() - Method in class topics.divideconquer.median.MedianTest
shouldFindMedianOddQuickselect() - Method in class topics.divideconquer.median.MedianTest
shouldFindMedianOddSorting() - Method in class topics.divideconquer.median.MedianTest
shouldFindNoMajorityDivideAndConquer() - Method in class topics.divideconquer.majoritarian.MajoritarianElementTest
shouldFindNoMajorityIterative() - Method in class topics.divideconquer.majoritarian.MajoritarianElementTest
shouldFindNoMajoritySorting() - Method in class topics.divideconquer.majoritarian.MajoritarianElementTest
shouldFindNoSolutionsFromDeadEndStartingPosition() - Method in class topics.backtracking.knighttour.ChessHorseAllTest: Scenario: 5x5 board starting at an edge coordinate (1,4).
shouldFindNoSolutionsOn3x3Board() - Method in class topics.backtracking.nqueens.ChessQueensAllTest: Scenario: A 3x3 chessboard.
shouldFindOneSubsetSummingToFourteenUsingPerfectSquares() - Method in class topics.backtracking.subsetsum.SubsetsGivenSumTest: Scenario: A set consisting of the first 4 perfect squares {1, 4, 9, 16}.
shouldFindOptimalAreaForSixPiecesOn5x5Board() - Method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Scenario: 6 assorted pieces evaluated on a 5x5 grid.
shouldFindOptimalAreaForSixPiecesOn8x8Board() - Method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Scenario: 6 assorted pieces evaluated on a larger 8x8 grid.
shouldFindOptimalAreaForThreePiecesOn5x5Board() - Method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Scenario: 3 assorted pieces evaluated on a 5x5 grid.
shouldFindOptimalAreaForTwoPiecesOn5x5Board() - Method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Scenario: 2 assorted pieces evaluated on a 5x5 grid.
shouldFindOptimalAreaUsingConcurrentBranchAndBound() - Method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Scenario: Multithreaded evaluation of 6 pieces on an 8x8 grid.
shouldFindOptimalAssignmentCostForFourAgents() - Method in class topics.branchandbound.agents.AgentsTasksTest: Scenario: A hardcoded 4x4 non-uniform cost matrix.
shouldFindOptimalCombinationWhenGreedyFails() - Method in class topics.dynamic.change.ChangeTest
shouldFindOptimalFractionalDistribution() - Method in class topics.greedy.knapsack.FractionalKnapsackTest
shouldFindOptimalSolution() - Method in class topics.greedy.change.ChangeTest
shouldFindOptimalValueWhenGreedyFails() - Method in class topics.dynamic.knapsack.Knapsack01Test
shouldFindTenSolutionsOn5x5Board() - Method in class topics.backtracking.nqueens.ChessQueensAllTest: Scenario: A 5x5 chessboard.
shouldFindThreeSubsetsSummingToTenUsingNaturalNumbers() - Method in class topics.backtracking.subsetsum.SubsetsGivenSumTest: Scenario: A set consisting of the first 5 natural numbers {1, 2, 3, 4, 5}.
shouldFindTwoSolutionsOn4x4Board() - Method in class topics.backtracking.nqueens.ChessQueensAllTest: Scenario: A 4x4 chessboard.
shouldFindValidCycle() - Method in class topics.greedy.tsp.TravelingSalesmanTest
shouldGenerateExactlyOneHundredTwentyPermutationsForFiveElements() - Method in class topics.backtracking.permutations.PermutationsTest: Scenario: Generating permutations for a set of 5 elements.
shouldGenerateExactlyTwentyFourPermutationsForFourElements() - Method in class topics.backtracking.permutations.PermutationsTest: Scenario: Generating permutations for a set of 4 elements.
shouldGenerateMainExamplePermutations() - Method in class topics.backtracking.stringinterleaving.StringInterleavingGeneratorTest
shouldGenerateSmallPermutations() - Method in class topics.backtracking.stringinterleaving.StringInterleavingGeneratorTest
shouldHandleAllNegativeArrays() - Method in class topics.divideconquer.maxsum.MaxSumTest
shouldHandleExactFitBoundaries() - Method in class topics.dynamic.knapsack.Knapsack01Test
shouldHandleFractionalBenefitValues() - Method in class topics.dynamic.knapsack.Knapsack01Test
shouldHandleHeavyCapacityWithVariedSpread() - Method in class topics.dynamic.knapsack.Knapsack01Test
shouldHandleIterativeBaseCase() - Method in class topics.divideconquer.factorial.FactorialTest
shouldHandleLongCeiling() - Method in class topics.divideconquer.factorial.FactorialTest
shouldHandleNegativeInputs() - Method in class topics.divideconquer.gcd.GCDTest
shouldHandleRecursiveBaseCase() - Method in class topics.divideconquer.factorial.FactorialTest
shouldHandleSmallCapacityWithCompetitiveItems() - Method in class topics.dynamic.knapsack.Knapsack01Test
shouldIdentifyAlreadySolvedPuzzle() - Method in class topics.branchandbound.eightpuzzle.EightPuzzleTest: Scenario: A board that is inherently in the target state.
shouldLocateSolutionOn4x4Board() - Method in class topics.backtracking.nqueens.ChessQueensOneTest: Scenario: A 4x4 chessboard.
shouldLocateSolutionOnStandard5x5Board() - Method in class topics.backtracking.knighttour.ChessHorseOneTest: Scenario: Standard 5x5 board starting at the top-left corner.
shouldMaintainCorrectnessWhenGreedyIsOptimal() - Method in class topics.dynamic.change.ChangeTest
shouldMaximizeFileCount() - Method in class topics.greedy.disk.DiskPackingTest
shouldMaximizeVictoriesBasic() - Method in class topics.greedy.rapiddefense.RapidDefenseTest
shouldMaximizeVictoriesQuick() - Method in class topics.greedy.rapiddefense.RapidDefenseTest
shouldNavigateComplexSuboptimalTraps() - Method in class topics.dynamic.change.ChangeTest
shouldNotFindMissingElementUsingBinarySearch() - Method in class topics.foundation.search.SearchTest: Scenario: Binary search across a sorted dataset for a non-existent element.
shouldNotFindMissingElementUsingSentinelSearch() - Method in class topics.foundation.search.SearchTest: Scenario: Sentinel-backed sequential search for a non-existent element.
shouldNotFindMissingElementUsingSequentialSearch() - Method in class topics.foundation.search.SearchTest: Scenario: Standard sequential search for a non-existent element.
shouldNotFindSolutionFromDeadEndStartingPosition() - Method in class topics.backtracking.knighttour.ChessHorseOneTest: Scenario: 5x5 board starting at an edge coordinate (1,4).
shouldNotFindSolutionOn3x3Board() - Method in class topics.backtracking.nqueens.ChessQueensOneTest: Scenario: A 3x3 chessboard.
shouldNotMutateOriginalArray() - Method in class topics.divideconquer.median.MedianTest
shouldNotMutateOriginalArray() - Method in class topics.divideconquer.mode.ModeTest
shouldNotReturnAdjacentValues() - Method in class topics.foundation.helloworld.HelloWorldTest: 10 + 40 should not equal adjacent values.
shouldProcessFilesInParallel() - Method in class topics.parallel.fileprocessing.FileProcessingTaskTest: Scenario: Scanning and processing a directory in parallel.
shouldRejectIncorrectLengths() - Method in class topics.greedy.stringinterleaving.StringInterleavingTest
shouldRejectIncorrectMaximumValues() - Method in class topics.foundation.maximum.GetMaximumFromListTest: Scenario: Verifying the algorithm avoids mathematically incorrect extractions.
shouldRejectIncorrectSummationTotals() - Method in class topics.foundation.sum.GetAdditionFromListTest: Scenario: Verifying the algorithm avoids mathematically incorrect aggregations.
shouldRejectInvalidInterleaving() - Method in class topics.divideconquer.stringinterleaving.StringInterleavingTest
shouldRejectInvalidInterleaving() - Method in class topics.dynamic.stringinterleaving.StringInterleavingTest
shouldRejectNegativeInputs() - Method in class topics.divideconquer.factorial.FactorialTest
shouldRejectNegativeInputs() - Method in class topics.foundation.factorial.FactorialTest: Scenario: Invoking the safe computation with a negative integer (-4).
shouldRejectPlacementWhenInsufficientSpaceExists() - Method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Scenario: Pieces that physically exceed the geometric limits of a 2x2 board.
shouldRejectUnsolvablePuzzleBoard() - Method in class topics.branchandbound.eightpuzzle.EightPuzzleTest: Scenario: A mathematically scrambled board containing an odd inversion parity, making it unsolvable.
shouldReportSystemParallelismCapabilities() - Method in class topics.parallel.utils.ParallelismInfoTest: Scenario: Querying system resources and pool constraints.
shouldReturnMinWhenNotFoundIteratively() - Method in class topics.divideconquer.search.BinarySearchTest
shouldReturnMinWhenNotFoundIteratively() - Method in class topics.divideconquer.search.SequentialSearchTest
shouldReturnMinWhenNotFoundRecursively() - Method in class topics.divideconquer.search.BinarySearchTest
shouldReturnMinWhenNotFoundRecursively() - Method in class topics.divideconquer.search.SequentialSearchTest
shouldReturnSumOfTwoIntegers() - Method in class topics.foundation.helloworld.HelloWorldTest: 10 + 40 should equal 50.
shouldSolvePuzzleUsingManhattanHeuristic() - Method in class topics.branchandbound.eightpuzzle.EightPuzzleTest: Scenario: A moderately scrambled board configuration.
shouldSolvePuzzleUsingMisplacedTilesHeuristic() - Method in class topics.branchandbound.eightpuzzle.EightPuzzleTest: Scenario: A highly scrambled board configuration.
shouldSolveTheAmbiguousCase() - Method in class topics.divideconquer.stringinterleaving.StringInterleavingTest
shouldSolveTheGreedyTrap() - Method in class topics.dynamic.stringinterleaving.StringInterleavingTest
shouldSortLargeReversedSequence() - Method in class topics.sorting.mergesort.MergesortTest: Scenario: A large array consisting of exactly 1,000 elements strictly in reverse order.
shouldSortLargerVariedSequence() - Method in class topics.sorting.bubble.BidirectionalBubbleTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.bubble.BubbleSentinelTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.bubble.BubbleTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.heapsort.HeapsortTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.insertion.BinaryInsertionTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.insertion.DirectInsertionTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.quicksort.QuicksortTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.selection.DirectSelectionTest: Scenario: Larger array with wider numerical variance.
shouldSortLargerVariedSequence() - Method in class topics.sorting.shellsort.ShellsortTest: Scenario: Larger array containing multi-digit integers spanning different magnitudes.
shouldSortMultiDigitSequence() - Method in class topics.sorting.radix.RadixTest: Scenario: Larger array containing multi-digit integers spanning different magnitudes (Units to Thousands).
shouldSortSingleDigitSequence() - Method in class topics.sorting.radix.RadixTest: Scenario: Small array with single-digit integers.
shouldSortSmallMixedSequence() - Method in class topics.sorting.bubble.BidirectionalBubbleTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.bubble.BubbleSentinelTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.bubble.BubbleTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.heapsort.HeapsortTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.insertion.BinaryInsertionTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.insertion.DirectInsertionTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.mergesort.MergesortTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.quicksort.QuicksortTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.selection.DirectSelectionTest: Scenario: Small array with mixed inversions.
shouldSortSmallMixedSequence() - Method in class topics.sorting.shellsort.ShellsortTest: Scenario: Small array with mixed inversions.
shouldSumIteratively() - Method in class topics.divideconquer.vectorsum.VectorSumTest
shouldSumRecursivelyWithDivision() - Method in class topics.divideconquer.vectorsum.VectorSumTest
shouldSumRecursivelyWithSubtraction() - Method in class topics.divideconquer.vectorsum.VectorSumTest
shouldThrowExceptionOnNegativeInput() - Method in class topics.divideconquer.fibonacci.FibonacciTest
shouldVerifyCleanInterleaving() - Method in class topics.greedy.stringinterleaving.StringInterleavingTest
shouldVerifyMixedInterleaving() - Method in class topics.divideconquer.stringinterleaving.StringInterleavingTest
shouldVerifyMixedInterleaving() - Method in class topics.dynamic.stringinterleaving.StringInterleavingTest
shouldVerifyMixedInterleaving() - Method in class topics.greedy.stringinterleaving.StringInterleavingTest
shouldVerifySequentialInterleaving() - Method in class topics.divideconquer.stringinterleaving.StringInterleavingTest
shouldVerifySequentialInterleaving() - Method in class topics.dynamic.stringinterleaving.StringInterleavingTest
Simple Cycles of a Node - Section in class topics.backtracking.tsp.CyclesAll
Simple Paths in a Graph - Section in class topics.backtracking.paths.PathSimple
Single-Plumber Scheduling - Section in class topics.greedy.plumber.Plumber
sol - Static variable in class topics.backtracking.permutations.PermutationsTimes
solve() - Method in class topics.backtracking.agents.AgentsTasks: Triggers the backtracking exploration to find the optimal assignment.
solve() - Method in class topics.backtracking.knighttour.ChessHorseAll: Triggers the backtracking execution to find all valid tours.
solve() - Method in class topics.backtracking.knighttour.ChessHorseOne: Triggers the backtracking execution to find the first valid tour.
solve() - Method in class topics.backtracking.nqueens.ChessQueensAll: Triggers the backtracking execution to find all valid N-Queens arrangements.
solve() - Method in class topics.backtracking.nqueens.ChessQueensOne: Triggers the backtracking execution to find the first valid N-Queens arrangement.
solve() - Method in class topics.backtracking.subsetsum.SubsetsGivenSum: Triggers the backtracking execution to find all valid subsets.
solve() - Method in class topics.parallel.fibonacci.FibonacciAlgorithm: Triggers the recursive calculation.
solve(int[][], int) - Method in class topics.greedy.tsp.TravelingSalesman: Executes the Nearest Neighbor heuristic. * @param weights Adjacency matrix of the graph.
solveTour(int[]) - Method in class topics.greedy.knighttour.ChessHorse: Attempts to complete the Knight's Tour starting from a specific position.
solveTour(int[]) - Method in class topics.greedy.knighttour.ChessHorseSimpleHeuristic: Attempts to complete the Knight's Tour using a naive first-fit greedy approach.
sort(int[]) - Method in class topics.sorting.bubble.BidirectionalBubble
sort(int[]) - Method in class topics.sorting.bubble.Bubble
sort(int[]) - Method in class topics.sorting.bubble.BubbleSentinel
sort(int[]) - Method in class topics.sorting.heapsort.Heapsort
sort(int[]) - Method in class topics.sorting.insertion.BinaryInsertion
sort(int[]) - Method in class topics.sorting.insertion.DirectInsertion
sort(int[]) - Method in class topics.sorting.mergesort.Mergesort
sort(int[]) - Method in class topics.sorting.quicksort.Quicksort
sort(int[]) - Method in class topics.sorting.radix.Radix
sort(int[]) - Method in class topics.sorting.selection.DirectSelection
sort(int[]) - Method in class topics.sorting.shellsort.Shellsort
sort(int[]) - Method in interface topics.sorting.utils.SortingAlgorithm: Sorts the elements in-place silently.
sort(int[], boolean) - Method in class topics.sorting.bubble.BidirectionalBubble
sort(int[], boolean) - Method in class topics.sorting.bubble.Bubble
sort(int[], boolean) - Method in class topics.sorting.bubble.BubbleSentinel
sort(int[], boolean) - Method in class topics.sorting.heapsort.Heapsort
sort(int[], boolean) - Method in class topics.sorting.insertion.BinaryInsertion
sort(int[], boolean) - Method in class topics.sorting.insertion.DirectInsertion
sort(int[], boolean) - Method in class topics.sorting.mergesort.Mergesort
sort(int[], boolean) - Method in class topics.sorting.quicksort.Quicksort
sort(int[], boolean) - Method in class topics.sorting.radix.Radix
sort(int[], boolean) - Method in class topics.sorting.selection.DirectSelection
sort(int[], boolean) - Method in class topics.sorting.shellsort.Shellsort
sort(int[], boolean) - Method in interface topics.sorting.utils.SortingAlgorithm: Sorts the elements in-place, optionally emitting step-by-step traces to visualize the algorithmic progression.
SortingAlgorithm - Interface in topics.sorting.utils: Sorting Algorithm Contract
Sorting Algorithm Contract - Section in interface topics.sorting.utils.SortingAlgorithm
Sorting Utilities - Section in class topics.sorting.utils.Util
source - Variable in class topics.backtracking.paths.PathSimple
source - Variable in class topics.backtracking.tsp.HamiltonianAll
Space-Optimized DP Transition - Section in class topics.dynamic.change.Change
StackExample - Class in topics.foundation.structures: Legacy Stack Demonstration
StackExample() - Constructor for class topics.foundation.structures.StackExample
State Node for String Interleaving - Section in class topics.branchandbound.stringinterleaving.InterleavingNode
State Space Tree Node - Section in class topics.branchandbound.utils.Node
Strategy 1: Row-Minima (Agent-Driven) - Section in topics.greedy.agents.AgentsTasks.assignTasksToAgents()
Strategy 2: Column-Minima (Task-Driven) - Section in topics.greedy.agents.AgentsTasks.assignAgentsToTasks()
StringInterleaving - Class in topics.divideconquer.stringinterleaving: String Interleaving
StringInterleaving - Class in topics.dynamic.stringinterleaving: String Interleaving
StringInterleaving - Class in topics.greedy.stringinterleaving: String Interleaving
StringInterleaving() - Constructor for class topics.divideconquer.stringinterleaving.StringInterleaving
StringInterleaving() - Constructor for class topics.dynamic.stringinterleaving.StringInterleaving
StringInterleaving() - Constructor for class topics.greedy.stringinterleaving.StringInterleaving
String Interleaving - Section in class topics.divideconquer.stringinterleaving.StringInterleaving
String Interleaving - Section in class topics.dynamic.stringinterleaving.StringInterleaving
String Interleaving - Section in class topics.greedy.stringinterleaving.StringInterleaving
StringInterleavingBBTest - Class in topics.branchandbound.stringinterleaving: Validation Suite for State Space Search (Binvalid input: '&B' Architecture)
StringInterleavingBBTest() - Constructor for class topics.branchandbound.stringinterleaving.StringInterleavingBBTest
StringInterleavingBenchmark - Class in topics.branchandbound.stringinterleaving: The Master Benchmark: String Interleaving Across Paradigms
StringInterleavingBenchmark() - Constructor for class topics.branchandbound.stringinterleaving.StringInterleavingBenchmark
StringInterleavingGenerator - Class in topics.backtracking.stringinterleaving: String Interleaving Generator
StringInterleavingGenerator - Class in topics.branchandbound.stringinterleaving: String Interleaving Generator
StringInterleavingGenerator() - Constructor for class topics.backtracking.stringinterleaving.StringInterleavingGenerator
StringInterleavingGenerator(String, String, Heap) - Constructor for class topics.branchandbound.stringinterleaving.StringInterleavingGenerator
String Interleaving Generator - Section in class topics.backtracking.stringinterleaving.StringInterleavingGenerator
String Interleaving Generator - Section in class topics.branchandbound.stringinterleaving.StringInterleavingGenerator
StringInterleavingGeneratorTest - Class in topics.backtracking.stringinterleaving: Validation Suite for Interleaving Generator
StringInterleavingGeneratorTest() - Constructor for class topics.backtracking.stringinterleaving.StringInterleavingGeneratorTest
StringInterleavingTest - Class in topics.divideconquer.stringinterleaving: Validation Suite for Recursive String Interleaving
StringInterleavingTest - Class in topics.dynamic.stringinterleaving: Validation Suite for DP String Interleaving
StringInterleavingTest - Class in topics.greedy.stringinterleaving: Validation Suite for Greedy String Interleaving
StringInterleavingTest() - Constructor for class topics.divideconquer.stringinterleaving.StringInterleavingTest
StringInterleavingTest() - Constructor for class topics.dynamic.stringinterleaving.StringInterleavingTest
StringInterleavingTest() - Constructor for class topics.greedy.stringinterleaving.StringInterleavingTest
SubsetsGivenSum - Class in topics.backtracking.subsetsum: Subset Sum
SubsetsGivenSum(int[], int) - Constructor for class topics.backtracking.subsetsum.SubsetsGivenSum: Initializes the Subset Sum solver.
SubsetsGivenSumTest - Class in topics.backtracking.subsetsum: Test Suite for SubsetsGivenSum
SubsetsGivenSumTest() - Constructor for class topics.backtracking.subsetsum.SubsetsGivenSumTest
Subset Sum - Section in class topics.backtracking.subsetsum.SubsetsGivenSum
sum(int[]) - Method in class topics.foundation.sum.GetAdditionFromList: Computes the total aggregate value of the provided sequence of integers.
sum(int, int) - Method in class topics.foundation.helloworld.HelloWorld: Returns the sum of two integers.
sumIterative(int[]) - Method in class topics.divideconquer.vectorsum.VectorSum: 1.
sumRecursiveDivision(int[]) - Method in class topics.divideconquer.vectorsum.VectorSum: 3.
sumRecursiveSubtraction(int[]) - Method in class topics.divideconquer.vectorsum.VectorSum: 2.
swap(int[], int, int) - Static method in class topics.divideconquer.median.Util: Swaps two elements within an array.
swap(int[], int, int) - Static method in class topics.sorting.utils.Util: Interchanges (swaps) two elements within an array in-place.

T

3. Tail Recursive (D&C by Subtraction) - Section in topics.divideconquer.fibonacci.Fibonacci.fibonacciTailRecursive(int)
3. Tail Recursive Approach (Divide & Conquer by Subtraction) - Section in topics.dynamic.fibonacci.Fibonacci.fibonacciTailRecursive(int)
target - Variable in class topics.backtracking.paths.PathSimple
Task Assignment - Section in class topics.branchandbound.agents.AgentsTasks
teardown() - Static method in class topics.backtracking.knighttour.ChessHorseAllTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.backtracking.knighttour.ChessHorseOneTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.backtracking.nqueens.ChessQueensAllTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.backtracking.nqueens.ChessQueensOneTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.backtracking.permutations.PermutationsTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.backtracking.subsetsum.SubsetsGivenSumTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.branchandbound.agents.AgentsTasksTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.branchandbound.eightpuzzle.EightPuzzleTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Static method in class topics.branchandbound.rectangles.RectanglesPlacementTest: Cleans up resources after the entire test suite has finished execution.
teardown() - Method in class topics.foundation.factorial.FactorialTest: Cleans up resources after the validations have completed execution.
teardown() - Static method in class topics.parallel.cuberoot.RecursiveActionComparisonTest
teardown() - Static method in class topics.parallel.fibonacci.FibonacciAlgorithmTest: Cleans up resources after validations complete.
teardown() - Static method in class topics.parallel.fibonacci.FibonacciTaskTest: Gracefully shuts down the thread pool, releasing OS resources.
teardown() - Static method in class topics.parallel.fileprocessing.FileProcessingTaskTest
teardown() - Static method in class topics.parallel.square.RecursiveActionSquareTest: Disposes of operational hardware thread pools to guarantee clean environment teardown.
teardown() - Static method in class topics.parallel.sum.RecursiveTaskSumTest: Disposes of hardware execution thread environments gracefully.
testCompleteGraphPermutations() - Method in class topics.backtracking.tsp.HamiltonianAllTest
testCycles() - Method in class topics.backtracking.tsp.CyclesAllTest
testFibonacciDP() - Method in class topics.dynamic.fibonacci.FibonacciTest
testFibonacciIterative() - Method in class topics.dynamic.fibonacci.FibonacciTest
testFibonacciLogarithmic() - Method in class topics.dynamic.fibonacci.FibonacciTest
testFibonacciNaiveRecursive() - Method in class topics.dynamic.fibonacci.FibonacciTest
testFibonacciTailRecursive() - Method in class topics.dynamic.fibonacci.FibonacciTest
testNegativeInputThrowsException() - Method in class topics.dynamic.fibonacci.FibonacciTest
testPathBest() - Method in class topics.backtracking.paths.PathBestTest
testPathBestPruning() - Method in class topics.backtracking.paths.PathBestPruningTest
testPathInput4() - Method in class topics.backtracking.paths.PathAllTest
testPathInput4() - Method in class topics.backtracking.paths.PathSimpleTest
testPathWorst() - Method in class topics.backtracking.paths.PathWorstTest
testSalesmanOptimization() - Method in class topics.backtracking.tsp.SalesmanTest
testSalesmanPruning() - Method in class topics.backtracking.tsp.SalesmanPruningTest
Test Suite for Array Summation - Section in class topics.foundation.sum.GetAdditionFromListTest
Test Suite for ChessHorseAll - Section in class topics.backtracking.knighttour.ChessHorseAllTest
Test Suite for ChessHorseOne - Section in class topics.backtracking.knighttour.ChessHorseOneTest
Test Suite for ChessQueensAll - Section in class topics.backtracking.nqueens.ChessQueensAllTest
Test Suite for ChessQueensOne - Section in class topics.backtracking.nqueens.ChessQueensOneTest
Test Suite for Optimal Rectangles Placement - Section in class topics.branchandbound.rectangles.RectanglesPlacementTest
Test Suite for Permutations Generator - Section in class topics.backtracking.permutations.PermutationsTest
Test Suite for SubsetsGivenSum - Section in class topics.backtracking.subsetsum.SubsetsGivenSumTest
Test Suite for Task Assignment Algorithm - Section in class topics.branchandbound.agents.AgentsTasksTest
Test Suite for the 8-Puzzle Solver - Section in class topics.branchandbound.eightpuzzle.EightPuzzleTest
The 8-Puzzle - Section in class topics.branchandbound.eightpuzzle.EightPuzzle
The Backtracking Paradigm - Section in class topics.backtracking.stringinterleaving.StringInterleavingGenerator
The DP State Matrix - Section in class topics.dynamic.stringinterleaving.StringInterleaving
The Greedy Choice - Section in class topics.greedy.knapsack.FractionalKnapsack
The Greedy Strategy - Section in class topics.greedy.plumber.MultiPlumber
The Greedy Strategy - Section in class topics.greedy.plumber.Plumber
The Greedy Trap - Section in class topics.greedy.change.Change
The Greedy Trap - Section in class topics.greedy.knighttour.ChessHorse
The Greedy Trap - Section in class topics.greedy.stringinterleaving.StringInterleaving
The Greedy Trap - Section in class topics.greedy.tsp.TravelingSalesman
The Integer Overflow Trap - Section in class topics.divideconquer.factorial.Factorial
The Knight's Tour (All Solutions) - Section in class topics.backtracking.knighttour.ChessHorseAll
The Knight's Tour (First Solution) - Section in class topics.backtracking.knighttour.ChessHorseOne
The Master Benchmark: String Interleaving Across Paradigms - Section in class topics.branchandbound.stringinterleaving.StringInterleavingBenchmark
The N-Queens (All Solutions) - Section in class topics.backtracking.nqueens.ChessQueensAll
The N-Queens (First Solution) - Section in class topics.backtracking.nqueens.ChessQueensOne
The Overlapping Subproblems Trap - Section in class topics.dynamic.combinations.Combinations
threshold - Variable in class topics.backtracking.paths.PathAll
topics.backtracking.agents - package topics.backtracking.agents
topics.backtracking.knighttour - package topics.backtracking.knighttour
topics.backtracking.nqueens - package topics.backtracking.nqueens
topics.backtracking.paths - package topics.backtracking.paths
topics.backtracking.permutations - package topics.backtracking.permutations
topics.backtracking.stringinterleaving - package topics.backtracking.stringinterleaving
topics.backtracking.subsetsum - package topics.backtracking.subsetsum
topics.backtracking.tsp - package topics.backtracking.tsp
topics.branchandbound.agents - package topics.branchandbound.agents
topics.branchandbound.eightpuzzle - package topics.branchandbound.eightpuzzle
topics.branchandbound.rectangles - package topics.branchandbound.rectangles
topics.branchandbound.stringinterleaving - package topics.branchandbound.stringinterleaving
topics.branchandbound.utils - package topics.branchandbound.utils
topics.branchandbound.utils.threads - package topics.branchandbound.utils.threads
topics.divideconquer.factorial - package topics.divideconquer.factorial
topics.divideconquer.fibonacci - package topics.divideconquer.fibonacci
topics.divideconquer.gcd - package topics.divideconquer.gcd
topics.divideconquer.majoritarian - package topics.divideconquer.majoritarian
topics.divideconquer.maxsum - package topics.divideconquer.maxsum
topics.divideconquer.median - package topics.divideconquer.median
topics.divideconquer.mode - package topics.divideconquer.mode
topics.divideconquer.search - package topics.divideconquer.search
topics.divideconquer.stringinterleaving - package topics.divideconquer.stringinterleaving
topics.divideconquer.vectorsum - package topics.divideconquer.vectorsum
topics.dynamic.change - package topics.dynamic.change
topics.dynamic.combinations - package topics.dynamic.combinations
topics.dynamic.fibonacci - package topics.dynamic.fibonacci
topics.dynamic.floyd - package topics.dynamic.floyd
topics.dynamic.knapsack - package topics.dynamic.knapsack
topics.dynamic.river - package topics.dynamic.river
topics.dynamic.stringinterleaving - package topics.dynamic.stringinterleaving
topics.foundation.factorial - package topics.foundation.factorial
topics.foundation.helloworld - package topics.foundation.helloworld
topics.foundation.maximum - package topics.foundation.maximum
topics.foundation.maxpairwise - package topics.foundation.maxpairwise
topics.foundation.search - package topics.foundation.search
topics.foundation.structures - package topics.foundation.structures
topics.foundation.sum - package topics.foundation.sum
topics.greedy.agents - package topics.greedy.agents
topics.greedy.change - package topics.greedy.change
topics.greedy.disk - package topics.greedy.disk
topics.greedy.knapsack - package topics.greedy.knapsack
topics.greedy.knighttour - package topics.greedy.knighttour
topics.greedy.plumber - package topics.greedy.plumber
topics.greedy.rapiddefense - package topics.greedy.rapiddefense
topics.greedy.stringinterleaving - package topics.greedy.stringinterleaving
topics.greedy.tsp - package topics.greedy.tsp
topics.parallel.cuberoot - package topics.parallel.cuberoot
topics.parallel.fibonacci - package topics.parallel.fibonacci
topics.parallel.fileprocessing - package topics.parallel.fileprocessing
topics.parallel.square - package topics.parallel.square
topics.parallel.sum - package topics.parallel.sum
topics.parallel.utils - package topics.parallel.utils
topics.sorting.bubble - package topics.sorting.bubble
topics.sorting.heapsort - package topics.sorting.heapsort
topics.sorting.insertion - package topics.sorting.insertion
topics.sorting.mergesort - package topics.sorting.mergesort
topics.sorting.quicksort - package topics.sorting.quicksort
topics.sorting.radix - package topics.sorting.radix
topics.sorting.selection - package topics.sorting.selection
topics.sorting.shellsort - package topics.sorting.shellsort
topics.sorting.utils - package topics.sorting.utils
toString() - Method in class topics.branchandbound.agents.AssignmentState
toString() - Method in class topics.branchandbound.eightpuzzle.PuzzleState
toString() - Method in class topics.branchandbound.rectangles.BoardState
toString() - Method in class topics.branchandbound.rectangles.Game
toString() - Method in class topics.branchandbound.stringinterleaving.InterleavingNode
toString() - Method in record class topics.greedy.tsp.SalesmanSolution: Returns a string representation of this record class.
totalCost() - Method in record class topics.greedy.tsp.SalesmanSolution: Returns the value of the totalCost record component.
trace(int, int[]) - Static method in class topics.sorting.utils.Util: Logs the current state of the array during a specific iteration.
traceMessage(String, int[]) - Static method in class topics.sorting.utils.Util: Logs a custom contextual message alongside the array contents.
traceShellSort(int, int, int[]) - Static method in class topics.sorting.utils.Util: Logs the specific state for the Shell Sort algorithm.
TravelingSalesman - Class in topics.greedy.tsp: Traveling Salesman
TravelingSalesman() - Constructor for class topics.greedy.tsp.TravelingSalesman
Traveling Salesman - Section in class topics.backtracking.tsp.Salesman
Traveling Salesman - Section in class topics.greedy.tsp.TravelingSalesman
TravelingSalesmanTest - Class in topics.greedy.tsp
TravelingSalesmanTest() - Constructor for class topics.greedy.tsp.TravelingSalesmanTest
TreeSet Demonstration - Section in class topics.foundation.structures.TreeSetExample
TreeSetExample - Class in topics.foundation.structures: TreeSet Demonstration
TreeSetExample() - Constructor for class topics.foundation.structures.TreeSetExample
TSP Optimization with Pruning (Bounding) - Section in class topics.backtracking.tsp.SalesmanPruning

U

Util - Class in topics.divideconquer.median: Divide invalid input: '&' Conquer Utility
Util - Class in topics.sorting.utils: Sorting Utilities

V

v - Static variable in class topics.backtracking.permutations.PermutationsTimes
Validation Suite for 0/1 Knapsack - Section in class topics.dynamic.knapsack.Knapsack01Test
Validation Suite for 0/1 Knapsack (Greedy Trap) - Section in class topics.greedy.knapsack.Knapsack01Test
Validation Suite for Agent-Task Assignment Problems - Section in class topics.greedy.agents.AgentsTasksTest
Validation Suite for Backtracking Agent Assignment - Section in class topics.backtracking.agents.AgentsTasksTest
Validation Suite for Bidirectional Bubble Sort - Section in class topics.sorting.bubble.BidirectionalBubbleTest
Validation Suite for Binary Insertion Sort - Section in class topics.sorting.insertion.BinaryInsertionTest
Validation Suite for Binary Search - Section in class topics.divideconquer.search.BinarySearchTest
Validation Suite for Bubble Sort - Section in class topics.sorting.bubble.BubbleTest
Validation Suite for Combinations - Section in class topics.dynamic.combinations.CombinationsTest
Validation Suite for Direct Insertion Sort - Section in class topics.sorting.insertion.DirectInsertionTest
Validation Suite for Direct Selection Sort - Section in class topics.sorting.selection.DirectSelectionTest
Validation Suite for Disk Packing Greedy Strategies - Section in class topics.greedy.disk.DiskPackingTest
Validation Suite for Divide & Conquer Fibonacci - Section in class topics.divideconquer.fibonacci.FibonacciTest
Validation Suite for DP String Interleaving - Section in class topics.dynamic.stringinterleaving.StringInterleavingTest
Validation Suite for Dynamic Programming Coin Change - Section in class topics.dynamic.change.ChangeTest
Validation Suite for Exhaustive Hamiltonian Cycles - Section in class topics.backtracking.tsp.HamiltonianAllTest
Validation Suite for Factorial - Section in class topics.divideconquer.factorial.FactorialTest
Validation Suite for Factorial Algorithm - Section in class topics.foundation.factorial.FactorialTest
Validation Suite for Fibonacci Implementations - Section in class topics.dynamic.fibonacci.FibonacciTest
Validation Suite for Floyd-Warshall - Section in class topics.dynamic.floyd.FloydWarshallTest
Validation Suite for Fractional Knapsack - Section in class topics.greedy.knapsack.FractionalKnapsackTest
Validation Suite for Greatest Common Divisor - Section in class topics.divideconquer.gcd.GCDTest
Validation Suite for Greedy Coin Change - Section in class topics.greedy.change.ChangeTest
Validation Suite for Greedy String Interleaving - Section in class topics.greedy.stringinterleaving.StringInterleavingTest
Validation Suite for Heapsort - Section in class topics.sorting.heapsort.HeapsortTest
Validation Suite for Interleaving Generator - Section in class topics.backtracking.stringinterleaving.StringInterleavingGeneratorTest
Validation Suite for Knight's Tour (Greedy) - Section in class topics.greedy.knighttour.ChessHorseTest
Validation Suite for Knight's Tour (Naive Greedy) - Section in class topics.greedy.knighttour.ChessHorseSimpleHeuristicTest
Validation Suite for Majoritarian Element Algorithms - Section in class topics.divideconquer.majoritarian.MajoritarianElementTest
Validation Suite for Maximum Pairwise Product - Section in class topics.foundation.maxpairwise.MaxPairWiseProductTest
Validation Suite for Maximum Pairwise Product (Native 64-bit) - Section in class topics.foundation.maxpairwise.MaxPairWiseProductTest2
Validation Suite for Maximum Subarray Sum - Section in class topics.divideconquer.maxsum.MaxSumTest
Validation Suite for Maximum Value Extraction - Section in class topics.foundation.maximum.GetMaximumFromListTest
Validation Suite for Median Calculation - Section in class topics.divideconquer.median.MedianTest
Validation Suite for Mergesort - Section in class topics.sorting.mergesort.MergesortTest
Validation Suite for Mode Algorithms - Section in class topics.divideconquer.mode.ModeTest
Validation Suite for Multi-Plumber Scheduling - Section in class topics.greedy.plumber.MultiPlumberTest
Validation Suite for Naive Fibonacci - Section in class topics.parallel.fibonacci.FibonacciAlgorithmTest
Validation Suite for Optimized Bubble Sort (Sentinel) - Section in class topics.sorting.bubble.BubbleSentinelTest
Validation Suite for Parallel Array Transformation - Section in class topics.parallel.cuberoot.RecursiveActionComparisonTest
Validation Suite for Parallel Fibonacci - Section in class topics.parallel.fibonacci.FibonacciTaskTest
Validation Suite for Parallel File Processing - Section in class topics.parallel.fileprocessing.FileProcessingTaskTest
Validation Suite for Parallel Squaring - Section in class topics.parallel.square.RecursiveActionSquareTest
Validation Suite for Parallel Summation - Section in class topics.parallel.sum.RecursiveTaskSumTest
Validation Suite for Pruned TSP - Section in class topics.backtracking.tsp.SalesmanPruningTest
Validation Suite for Quicksort - Section in class topics.sorting.quicksort.QuicksortTest
Validation Suite for Radix Sort - Section in class topics.sorting.radix.RadixTest
Validation Suite for Recursive String Interleaving - Section in class topics.divideconquer.stringinterleaving.StringInterleavingTest
Validation Suite for River Travel (DP) - Section in class topics.dynamic.river.RiverTravelTest
Validation Suite for Search Algorithms - Section in class topics.foundation.search.SearchTest
Validation Suite for Sequential Search - Section in class topics.divideconquer.search.SequentialSearchTest
Validation Suite for Shellsort - Section in class topics.sorting.shellsort.ShellsortTest
Validation Suite for Shortest Path (Branch & Bound) - Section in class topics.backtracking.paths.PathBestPruningTest
Validation Suite for Shortest Path (Un-pruned) - Section in class topics.backtracking.paths.PathBestTest
Validation Suite for Single-Plumber Scheduling - Section in class topics.greedy.plumber.PlumberTest
Validation Suite for State Space Search (B&B Architecture) - Section in class topics.branchandbound.stringinterleaving.StringInterleavingBBTest
Validation Suite for Vector Summation Paradigms - Section in class topics.divideconquer.vectorsum.VectorSumTest
valueOf(String) - Static method in enum class topics.branchandbound.eightpuzzle.HeuristicType: Returns the enum constant of this class with the specified name.
valueOf(String) - Static method in enum class topics.branchandbound.rectangles.PieceOrientation: Returns the enum constant of this class with the specified name.
values() - Static method in enum class topics.branchandbound.eightpuzzle.HeuristicType: Returns an array containing the constants of this enum class, in the order they are declared.
values() - Static method in enum class topics.branchandbound.rectangles.PieceOrientation: Returns an array containing the constants of this enum class, in the order they are declared.
VectorExample - Class in topics.foundation.structures: Legacy Thread-Safe Vector Demonstration
VectorExample() - Constructor for class topics.foundation.structures.VectorExample
VectorSum - Class in topics.divideconquer.vectorsum: Vector Summation (Algorithmic Structural Variations)
VectorSum() - Constructor for class topics.divideconquer.vectorsum.VectorSum
Vector Summation (Algorithmic Structural Variations) - Section in class topics.divideconquer.vectorsum.VectorSum
VectorSumTest - Class in topics.divideconquer.vectorsum: Validation Suite for Vector Summation Paradigms
VectorSumTest() - Constructor for class topics.divideconquer.vectorsum.VectorSumTest
VERTICAL - Enum constant in enum class topics.branchandbound.rectangles.PieceOrientation: Represents a 90-degree rotational transposition.

W

weights - Variable in class topics.backtracking.paths.PathSimple
weights - Variable in class topics.backtracking.tsp.HamiltonianAll
Why Greedy Fails Here - Section in class topics.dynamic.change.Change
WorkerThread - Class in topics.branchandbound.utils.threads: Concurrent Worker Thread
WorkerThread() - Constructor for class topics.branchandbound.utils.threads.WorkerThread
worstCost - Variable in class topics.backtracking.paths.PathWorst
worstLength - Variable in class topics.backtracking.paths.PathWorst
worstPath - Variable in class topics.backtracking.paths.PathWorst
writeWeights() - Method in class topics.backtracking.paths.PathSimple
WRONG_PLACE - Enum constant in enum class topics.branchandbound.eightpuzzle.HeuristicType

X

x - Variable in class topics.branchandbound.rectangles.Piece: The primary horizontal dimension (width).

Y

y - Variable in class topics.branchandbound.rectangles.Piece: The primary vertical dimension (height).

A B C D E F G H I K L M N O P Q R S T U V W X Y
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form