Another example of an NP-hard problem is the optimization problem of finding the least-cost cyclic route through all nodes of a weighted graph.
Un alt exemplu de problemă NP-hard este problema de optimizare de a găsi ciclul de cost minim toate nodurile unui graf ponderat.