Examine more problems in graph theory, including the shortest path problem, the traveling salesman problem, and the Hamiltonian cycle problem. Some problems can be solved efficiently, while others are so hard that no simple solution has yet been found.
click here to see where to watch or .
Ready to Watch Discrete Mathematics, Season 1, Episode 23?