M.AMM.31: Solve problems involving scheduling or routing situations that can be represented by a vertex-edge graph; find critical paths, Euler paths, Hamiltonian paths, and minimal spanning trees (e.g., Konigsberg bridge problem, mail vs. Fed Ex delivery routes, kolam drawings of India, traveling salesman problem, and/or map coloring).