Tried implementing normal shortest path algorithm using DFS , construct the string acc to the string C then inserting it into Set data structure which will strong unique strings. I guess this is a kind of brute force approach. Can anyone help me with a optimised one ? ? ? ? ? ? ![ ]()![ ]()