Package topics.backtracking.times

package topics.backtracking.times

Execution-time benchmarks for backtracking algorithms.

Classes in this package measure and compare the running times of the backtracking implementations under different input sizes, providing empirical evidence to complement their theoretical complexity analyses.

Classes in This Package

• AgentsTasksTimes — benchmarks the agents-to-tasks assignment algorithm
• PermutationsTimes — benchmarks the permutation generator

Related Packages

Package	Description
topics.backtracking	Backtracking algorithms — systematic exploration of solution spaces with pruning.

Classes

Class	Description
AgentsTasksTimes	BACKTRACKING PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program can solve the problem using a backtracking algorithm
PermutationsTimes	BACKTRACKING PROBLEM: PERMUTATIONS OF N ELEMENTS This program calculates times to generate the permutations of n elements.