Distance Greater Than K Problem Statement

You are provided an undirected graph, a source vertex, and an integer k. Determine if there is any simple path (without any cycle) from the source vertex to any other vertex such that the path's distance exceeds k.

Input:

The first line contains four integers n, m, s, and k, where n is the number of vertices, m is the number of edges, and s is the source vertex.

The next m lines provide the description of each edge. Each edge is described by three integers a, b, and c, where a and b are the endpoints of the edge, and c is the length of the edge.

Output:

Return true if such a path exists, otherwise return false.

Example:

Example explanation can be added here.

Constraints:

• 1 <= n <= 10
• 1 <= m <= min(n*(n-1)/2, 100)
• 0 <= a, b, s < n
• 1 <= c, k <= 1000000
• Each vertex and edge is valid within the constraints specified.

Note: The graph does not contain self-loops.