Let be an undirected graph with edges and vertices, and let be three distinct vertices. Design and analyze an algorithm that computes a path from to that goes through.
A cycle cover of a directed graph is a collection of vertex-disjoint cycles that covers all the vertices. Describe and analyze an efficient algorithm to find a cycle cover for a given graph, or correctly report that no cycle cover exists. 2