👉 Dysdaemonia is a term used in computational complexity theory, specifically referring to a class of algorithms that are shown to be hard to solve efficiently even for small instances of size n. This class includes algorithms like the Floyd-Warshall algorithm and the Bellman-Ford algorithm, which are used to find the shortest path between two nodes in an undirected graph with non-negative edge weights.
