FM.N.2: Optimize networks in different ways and in different contexts by finding minimal spanning trees, shortest paths, and Hamiltonian paths including real-world problems.