For this Question: Given an undirected graph G (V, E) and two vertices v1 and v2 (as integers), check if there exists any path between them or not. Print true or false.
V is the number of vertices present in graph G and vertices are numbered from 0 to V-1.
E is the number of edges present in graph G.Line 1: Two Integers V and E (separated by space)
Next E lines: Two integers a and b, denoting that there exists an edge between vertex a and vertex b (separated by space)
Line (E+2): Two integers v1 and v2 (separated by space)

Constraints :
2 <= V <= 1000
1 <= E <= 1000
0 <= v1, v2 <= V-1For each testcase in new line, you need to print true or false.Sample Input 1 :
4 4
0 1
0 3
1 2
2 3
1 3

Sample Output 1 :
true

Explanation:
There are multiple path exists between 1 and 3. One of them is as such: 1 -> 2 -> 3., I have written this Solution Code: from queue import Queue
n,e=[int(x) for x in input().split()]
adj=dict()
for i in range(n):
    adj[i]=[]
for i in range(e):
    u,v=[int(x) for x in input().split()]
    adj[u].append(v)
    adj[v].append(u)
src,des=[int(x) for x in input().split()]
stack=[src]
vis=[False]*(n)
vis[src]=True
while len(stack) != 0:
    u=stack.pop(-1)
    for v in adj[u]:
        if(vis[v]==False):
            stack.append(v)
            vis[v]=True
ans=0
for x in vis:
    if x==False:
        ans += 1
if(vis[des]==True):
	print("true")
else:
	print("false"), In this Programming Language: Python, Now tell me if this Code is compilable or not?