👉 Hardnesses are a measure of how difficult it is for an algorithm to solve a problem. They are typically measured in terms of the number of operations or steps required by an algorithm to solve a given problem, and can be used to compare different algorithms based on their performance. Hardnesses are often visualized as graphs, where each node represents an algorithm and each edge represents the number of times it is run.