##
Find if there is a path of more than k length from a source
May 1, 2016

Given a graph, a source vertex in the graph and a number k, find if there is a simple path (without any cycle) starting from given source and ending at any other vertex. Input : Source s = 0, k = 58 Output : True There exists a simple path 0 -> 7 -> 1… Read More »