Dora's Preferred Route

Problem Statement

Dora's Preferred Route Problem Description Dora loves bike riding, and every weekend she plans a trip. This weekend, she is traveling from her source city (S) to a destination city (D). There are multiple other cities in the vicinity of these two cities, so she decides to take the route which has her visit as many cities as possible before reaching D, but by visiting any city at most only once. She prepares a map represented as a graph G, where each node is a city and each edge indicates a road between two cities. Can you help her find her preferred route? Write a program that accepts the graph G in the form of an adjacency matrix, along with the number of cities n (the cities are labeled 0 to n-1), the source city (S), and the destination city (D), and prints the route from S to D covering the maximum number of cities, with the cities printed in the order they are visited. If multiple such routes from S to D exist, print the lexicographically smallest route. Read the Input from STDIN