Final year academic project to cover all the edges of a given graph using minimum number of paths keeping the total path weight within a given constraint Q.